arXiv subjects

Yulin Zhang

Publications and source records attributed to Yulin Zhang.

At least 37 records · Page 2Linked to original sources

arXiv2025

Damage of bilayer structure in La3Ni2O7-d induced by high pO2 annealing

The discovery of superconductivity with onset temperature of ~80 K in pressurized bilayer Ruddlesden-Popper La3Ni2O7-d has attracted much attention. Despite intense research, determination of the exact oxygen content and understanding of the relationship between superconductivity and oxygen content remain a big challenge. Here, we report a systematical study on the structure and physical properties of La3Ni2O7-d polycrystalline powders which were prepared using sol-gel method at ambient pressure and then annealed under various oxygen pressure. We found that high pO2 annealing with slow cooling results in a new phase, which can be modeled using the hybrid single-layer-trilayer La3Ni2O7 or the tetragonal bilayer La3Ni2O7. Scanning transmission electron microscopy (STEM) measurements revealed significant single layers and trilayers after high oxygen pressure annealing, evidencing damage of the bilayer structure. The superconducting transition under high pressure became weak for high pO2 annealed samples, which is consistent with the damage of the bilayer structure. Our results reveal that the bilayer structure is fragile and post-annealing under near atmosphere pressure of oxygen is suitable to maintain bilayer structure and increase oxygen content at the same time.

cond-mat.supr-con↗

arXiv2025

A structure-preserving parametric finite element method with optimal energy stability condition for anisotropic surface diffusion

We propose and analyze a structure-preserving parametric finite element method (SP-PFEM) for the evolution of closed curves under anisotropic surface diffusion with surface energy density $\hatγ(θ)$. Our primary theoretical contribution establishes that the condition $3\hatγ(θ)-\hatγ(θ-π)\geq 0$ is both necessary and sufficient for unconditional energy stability within the framework of local energy estimates. The proposed method introduces a symmetric surface energy matrix $\hat{\boldsymbol{Z}}_k(θ)$ with a stabilizing function $k(θ)$, leading to a conservative weak formulation. Its fully discretization via SP-PFEM rigorously preserves the two geometric structures: enclosed area conservation and energy dissipation unconditionally under our energy stability condition. Numerical results are reported to demonstrate the efficiency and accuracy of the proposed method, along with its area conservation and energy dissipation properties.

math.NA↗

arXiv2024

A fixed-parameter tractable algorithm for combinatorial filter reduction

What is the minimal information that a robot must retain to achieve its task? To design economical robots, the literature dealing with reduction of combinatorial filters approaches this problem algorithmically. As lossless state compression is NP-hard, prior work has examined, along with minimization algorithms, a variety of special cases in which specific properties enable efficient solution. Complementing those findings, this paper refines the present understanding from the perspective of parameterized complexity. We give a fixed-parameter tractable algorithm for the general reduction problem by exploiting a transformation into clique covering. The transformation introduces new constraints that arise from sequential dependencies encoded within the input filter -- some of these constraints can be repaired, others are treated through enumeration. Through this approach, we identify parameters affecting filter reduction that are based upon inter-constraint couplings (expressed as a notion of their height and width), which add to the structural parameters present in the unconstrained problem of minimal clique covering. Compared with existing work, we precisely identify and quantitatively characterize those features that contribute to the problem's hardness: given a problem instance, the combinatorial core may be a fraction of the instance's full size, with a small subset of constraints needing to be considered, and even those may have directly identifiable couplings that collapse degrees of freedom in the enumeration.

cs.RO↗

arXiv2024

Part2Object: Hierarchical Unsupervised 3D Instance Segmentation

Unsupervised 3D instance segmentation aims to segment objects from a 3D point cloud without any annotations. Existing methods face the challenge of either too loose or too tight clustering, leading to under-segmentation or over-segmentation. To address this issue, we propose Part2Object, hierarchical clustering with object guidance. Part2Object employs multi-layer clustering from points to object parts and objects, allowing objects to manifest at any layer. Additionally, it extracts and utilizes 3D objectness priors from temporally consecutive 2D RGB frames to guide the clustering process. Moreover, we propose Hi-Mask3D to support hierarchical 3D object part and instance segmentation. By training Hi-Mask3D on the objects and object parts extracted from Part2Object, we achieve consistent and superior performance compared to state-of-the-art models in various settings, including unsupervised instance segmentation, data-efficient fine-tuning, and cross-dataset generalization. Code is release at https://github.com/ChengShiest/Part2Object

cs.CV↗

arXiv2024

An abstract theory of sensor eventification

Unlike traditional cameras, event cameras measure changes in light intensity and report differences. This paper examines the conditions necessary for other traditional sensors to admit eventified versions that provide adequate information despite outputting only changes. The requirements depend upon the regularity of the signal space, which we show may depend on several factors including structure arising from the interplay of the robot and its environment, the input-output computation needed to achieve its task, as well as the specific mode of access (synchronous, asynchronous, polled, triggered). Further, there are additional properties of stability (or non-oscillatory behavior) that can be desirable for a system to possess and that we show are also closely related to the preceding notions. This paper contributes theory and algorithms (plus a hardness result) that addresses these considerations while developing several elementary robot examples along the way.

cs.RO↗

arXiv2024

A Stabilized Parametric Finite Element Method for Surface Diffusion with an Arbitrary Surface Energy

We proposed a structure-preserving stabilized parametric finite element method (SPFEM) for the evolution of closed curves under anisotropic surface diffusion with an arbitrary surface energy $\hatγ(θ)$. By introducing a non-negative stabilizing function $k(θ)$ depending on $\hatγ(θ)$, we obtained a novel stabilized conservative weak formulation for the anisotropic surface diffusion. A SPFEM is presented for the discretization of this weak formulation. We construct a comprehensive framework to analyze and prove the unconditional energy stability of the SPFEM under a very mild condition on $\hatγ(θ)$. This method can be applied to simulate solid-state dewetting of thin films with arbitrary surface energies, which are characterized by anisotropic surface diffusion and contact line migration. Extensive numerical results are reported to demonstrate the efficiency, accuracy and structure-preserving properties of the proposed SPFEM with anisotropic surface energies $\hatγ(θ)$ arising from different applications.

math.NA↗

arXiv2023

A general class of combinatorial filters that can be minimized efficiently

State minimization of combinatorial filters is a fundamental problem that arises, for example, in building cheap, resource-efficient robots. But exact minimization is known to be NP-hard. This paper conducts a more nuanced analysis of this hardness than up till now, and uncovers two factors which contribute to this complexity. We show each factor is a distinct source of the problem's hardness and are able, thereby, to shed some light on the role played by (1) structure of the graph that encodes compatibility relationships, and (2) determinism-enforcing constraints. Just as a line of prior work has sought to introduce additional assumptions and identify sub-classes that lead to practical state reduction, we next use this new, sharper understanding to explore special cases for which exact minimization is efficient. We introduce a new algorithm for constraint repair that applies to a large sub-class of filters, subsuming three distinct special cases for which the possibility of optimal minimization in polynomial time was known earlier. While the efficiency in each of these three cases previously appeared to stem from seemingly dissimilar properties, when seen through the lens of the present work, their commonality now becomes clear. We also provide entirely new families of filters that are efficiently reducible.

cs.RO↗

arXiv2023

Learning a Robust Multiagent Driving Policy for Traffic Congestion Reduction

In most modern cities, traffic congestion is one of the most salient societal challenges. Past research has shown that inserting a limited number of autonomous vehicles (AVs) within the traffic flow, with driving policies learned specifically for the purpose of reducing congestion, can significantly improve traffic conditions. However, to date these AV policies have generally been evaluated under the same limited conditions under which they were trained. On the other hand, to be considered for practical deployment, they must be robust to a wide variety of traffic conditions. This article establishes for the first time that a multiagent driving policy can be trained in such a way that it generalizes to different traffic flows, AV penetration, and road geometries, including on multi-lane roads. Inspired by our successful results in a high-fidelity microsimulation, this article further contributes a novel extension of the well-known Cell Transmission Model (CTM) that, unlike past CTMs, is suitable for modeling congestion in traffic networks, and is thus suitable for studying congestion-reduction policies such as those considered in this article.

cs.AI↗

arXiv2022

Unsupervised Time-Aware Sampling Network with Deep Reinforcement Learning for EEG-Based Emotion Recognition

Recognizing human emotions from complex, multivariate, and non-stationary electroencephalography (EEG) time series is essential in affective brain-computer interface. However, because continuous labeling of ever-changing emotional states is not feasible in practice, existing methods can only assign a fixed label to all EEG timepoints in a continuous emotion-evoking trial, which overlooks the highly dynamic emotional states and highly non-stationary EEG signals. To solve the problems of high reliance on fixed labels and ignorance of time-changing information, in this paper we propose a time-aware sampling network (TAS-Net) using deep reinforcement learning (DRL) for unsupervised emotion recognition, which is able to detect key emotion fragments and disregard irrelevant and misleading parts. Extensive experiments are conducted on three public datasets (SEED, DEAP, and MAHNOB-HCI) for emotion recognition using leave-one-subject-out cross-validation, and the results demonstrate the superiority of the proposed method against previous unsupervised emotion recognition methods.

cs.HC↗

arXiv2022

Nondeterminism subject to output commitment in combinatorial filters

We study a class of filters -- discrete finite-state transition systems employed as incremental stream transducers -- that have application to robotics: e.g., to model combinatorial estimators and also as concise encodings of feedback plans/policies. The present paper examines their minimization problem under some new assumptions. Compared to strictly deterministic filters, allowing nondeterminism supplies opportunities for compression via re-use of states. But this paper suggests that the classic automata-theoretic concept of nondeterminism, though it affords said opportunities for reduction in state complexity, is problematic in many robotics settings. Instead, we argue for a new constrained type of nondeterminism that preserves input-output behavior for circumstances when, as for robots, causation forbids 'rewinding' of the world. We identify problem instances where compression under this constrained form of nondeterminism results in improvements over all deterministic filters. In this new setting, we examine computational complexity questions for the problem of reducing the state complexity of some given input filter. A hardness result for general deterministic input filters is presented, as well as for checking specific, narrower requirements, and some special cases. These results show that this class of nondeterminism gives problems of the same complexity class as classical nondeterminism, and the narrower questions help give a more nuanced understanding of the source of this complexity.

cs.RO↗

arXiv2022

On nondeterminism in combinatorial filters

The problem of combinatorial filter reduction arises from questions of resource optimization in robots; it is one specific way in which automation can help to achieve minimalism, to build better, simpler robots. This paper contributes a new definition of filter minimization that is broader than its antecedents, allowing filters (input, output, or both) to be nondeterministic. This changes the problem considerably. Nondeterministic filters are able to re-use states to obtain, essentially, more 'behavior' per vertex. We show that the gap in size can be significant (larger than polynomial), suggesting such cases will generally be more challenging than deterministic problems. Indeed, this is supported by the core computational complexity result established in this paper: producing nondeterministic minimizers is PSPACE-hard. The hardness separation for minimization which exists between deterministic filter and deterministic automata, thus, does not hold for the nondeterministic case.

cs.RO↗

arXiv2022

Cover Combinatorial Filters and their Minimization Problem (Extended Version)

Recent research has examined algorithms to minimize robots' resource footprints. The class of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been studied and methods for reducing their space requirements introduced. This paper extends existing combinatorial filters by introducing a natural generalization that we dub cover combinatorial filters. In addressing the new -- but still NP-complete -- problem of minimization of cover filters, this paper shows that multiple concepts previously believed to be true about combinatorial filters (and actually conjectured, claimed, or assumed to be) are in fact false. For instance, minimization does not induce an equivalence relation. We give an exact algorithm for the cover filter minimization problem. Unlike prior work (based on graph coloring) we consider a type of clique-cover problem, involving a new conditional constraint, from which we can find more general relations. In addition to solving the more general problem, the algorithm also corrects flaws present in all prior filter reduction methods. In employing SAT, the algorithm provides a promising basis for future practical development.

cs.DM↗

arXiv2021

Atmospheric Density Model Optimization and Spacecraft Orbit Prediction Improvements Based on Q-Sat Orbit Data

Atmospheric drag calculation error greatly reduce the low-earth orbit spacecraft trajectory prediction fidelity. To solve the issue, the "correction - prediction" strategy is usually employed. In the method, one parameter is fixed and other parameters are revised by inverting spacecraft orbit data. However, based on a single spacecraft data, the strategy usually performs poorly as parameters in drag force calculation are coupled with each other, which result in convoluted errors. A gravity field recovery and atmospheric density detection satellite, Q-Sat, developed by xxxxx Lab at xxx University, is launched on August 6th, 2020. The satellite is designed to be spherical for a constant drag coefficient regardless of its attitude. An orbit prediction method for low-earth orbit spacecraft with employment of Q-Sat data is proposed in present paper for decoupling atmospheric density and drag coefficient identification. For the first step, by using a dynamic approach-based inversion, several empirical atmospheric density models are revised based on Q-Sat orbit data. Depending on the performs, one of the revised atmospheric density model would be selected for the next step in which the same inversion is employed for drag coefficient identification for a low-earth orbit operating spacecraft whose orbit needs to be predicted. Finally, orbit prediction is conducted by extrapolation with the dynamic parameters in the previous steps. Tests are carried out with the proposed method by using a GOCE satellite 15-day continuous orbit data. Compared with legacy "correction - prediction" method in which only GOCE data is employed, the accuracy of the 24-hour orbit prediction is improved by about 171m the highest for the proposed method. 14-day averaged 24-hour prediction precision is elevated by approximately 70m.

physics.geo-ph↗

arXiv2021

On circulant and skew-circulant splitting algorithms for (continuous) Sylvester equations

We present a circulant and skew-circulant splitting (CSCS) iterative method for solving large sparse continuous Sylvester equations $AX + XB = C$, where the coefficient matrices $A$ and $B$ are Toeplitz matrices. A theoretical study shows that if the circulant and skew-circulant splitting factors of $A$ and $B$ are positive semi-definite and at least one is positive definite (not necessarily Hermitian), then the CSCS method converges to the unique solution of the Sylvester equation. In addition, we obtain an upper bound for the convergence factor of the CSCS iteration. This convergence factor depends only on the eigenvalues of the circulant and skew-circulant splitting matrices. A computational comparison with alternative methods reveals the efficiency and reliability of the proposed method.

math.NA↗

arXiv2021

Lattices of sensors reconsidered when less information is preferred

To treat sensing limitations (with uncertainty in both conflation of information and noise) we model sensors as covers. This leads to a semilattice organization of abstract sensors that is appropriate even when additional information is problematic (e.g., for tasks involving privacy considerations).

cs.RO↗

arXiv2021

AFD-Net: Adaptive Fully-Dual Network for Few-Shot Object Detection

Few-shot object detection (FSOD) aims at learning a detector that can fast adapt to previously unseen objects with scarce annotated examples, which is challenging and demanding. Existing methods solve this problem by performing subtasks of classification and localization utilizing a shared component (e.g., RoI head) in the detector, yet few of them take the distinct preferences of two subtasks towards feature embedding into consideration. In this paper, we carefully analyze the characteristics of FSOD, and present that a general few-shot detector should consider the explicit decomposition of two subtasks, as well as leveraging information from both of them to enhance feature representations. To the end, we propose a simple yet effective Adaptive Fully-Dual Network (AFD-Net). Specifically, we extend Faster R-CNN by introducing Dual Query Encoder and Dual Attention Generator for separate feature extraction, and Dual Aggregator for separate model reweighting. Spontaneously, separate state estimation is achieved by the R-CNN detector. Besides, for the acquisition of enhanced feature representations, we further introduce Adaptive Fusion Mechanism to adaptively perform feature fusion in different subtasks. Extensive experiments on PASCAL VOC and MS COCO in various settings show that, our method achieves new state-of-the-art performance by a large margin, demonstrating its effectiveness and generalization ability.

cs.CV↗

arXiv2021

Two-Step Image Dehazing with Intra-domain and Inter-domain Adaptation

Caused by the difference of data distributions, intra-domain gap and inter-domain gap are widely present in image processing tasks. In the field of image dehazing, certain previous works have paid attention to the inter-domain gap between the synthetic domain and the real domain. However, those methods only establish the connection from the source domain to the target domain without taking into account the large distribution shift within the target domain (intra-domain gap). In this work, we propose a Two-Step Dehazing Network (TSDN) with an intra-domain adaptation and a constrained inter-domain adaptation. First, we subdivide the distributions within the synthetic domain into subsets and mine the optimal subset (easy samples) by loss-based supervision. To alleviate the intra-domain gap of the synthetic domain, we propose an intra-domain adaptation to align distributions of other subsets to the optimal subset by adversarial learning. Finally, we conduct the constrained inter-domain adaptation from the real domain to the optimal subset of the synthetic domain, alleviating the domain shift between domains as well as the distribution shift within the real domain. Extensive experimental results demonstrate that our framework performs favorably against the state-of-the-art algorithms both on the synthetic datasets and the real datasets.

cs.CV↗

arXiv2021

Self-Paced Uncertainty Estimation for One-shot Person Re-Identification

The one-shot Person Re-ID scenario faces two kinds of uncertainties when constructing the prediction model from $X$ to $Y$. The first is model uncertainty, which captures the noise of the parameters in DNNs due to a lack of training data. The second is data uncertainty, which can be divided into two sub-types: one is image noise, where severe occlusion and the complex background contain irrelevant information about the identity; the other is label noise, where mislabeled affects visual appearance learning. In this paper, to tackle these issues, we propose a novel Self-Paced Uncertainty Estimation Network (SPUE-Net) for one-shot Person Re-ID. By introducing a self-paced sampling strategy, our method can estimate the pseudo-labels of unlabeled samples iteratively to expand the labeled samples gradually and remove model uncertainty without extra supervision. We divide the pseudo-label samples into two subsets to make the use of training samples more reasonable and effective. In addition, we apply a Co-operative learning method of local uncertainty estimation combined with determinacy estimation to achieve better hidden space feature mining and to improve the precision of selected pseudo-labeled samples, which reduces data uncertainty. Extensive comparative evaluation experiments on video-based and image-based datasets show that SPUE-Net has significant advantages over the state-of-the-art methods.

cs.CV↗