Searcharxiv⌕ Search

arXiv subjects

Xin Tong

Publications and source records attributed to Xin Tong.

At least 199 records · Page 11Linked to original sources

Barocaloric thermal batteries

Nowadays the world is facing a prominent paradox regarding thermal energy. The production of heat accounts for more than 50% of global final energy consumption while the waste heat potential analysis reveals that 72% of the global primary energy consumption is lost after conversion mainly in the form of heat. Towards global decarbonization, it is of vital importance to establish a solution to thermal energy utilization under full control. Here, we propose and realize an unprecedented concept -- barocaloric thermal batteries based on the inverse colossal barocaloric effect of NH4SCN. Thermal charging is initialized upon pressurization through an order-to-disorder phase transition below 364 K and in turn the discharging of 43 J g-1, which are eleven times more than the input mechanical energy, occurs on demand at depressurization at lower temperatures. The discharging is also manifested as a directly measured temperature rise of 12 K. The thermodynamic equilibrium nature of the pressure-restrained heat-carrying phase guarantees stable storage and/or transport over a variety of temporal and/or spatial scales. The barocaloric thermal batteries reinforced by their solid microscopic mechanism are expected to significantly advance the ability to take advantage of waste heat.

cond-mat.mtrl-sci↗

SkeletonNet: A Topology-Preserving Solution for Learning Mesh Reconstruction of Object Surfaces from RGB Images

This paper focuses on the challenging task of learning 3D object surface reconstructions from RGB images. Existingmethods achieve varying degrees of success by using different surface representations. However, they all have their own drawbacks,and cannot properly reconstruct the surface shapes of complex topologies, arguably due to a lack of constraints on the topologicalstructures in their learning frameworks. To this end, we propose to learn and use the topology-preserved, skeletal shape representationto assist the downstream task of object surface reconstruction from RGB images. Technically, we propose the novelSkeletonNetdesign that learns a volumetric representation of a skeleton via a bridged learning of a skeletal point set, where we use paralleldecoders each responsible for the learning of points on 1D skeletal curves and 2D skeletal sheets, as well as an efficient module ofglobally guided subvolume synthesis for a refined, high-resolution skeletal volume; we present a differentiablePoint2Voxellayer tomake SkeletonNet end-to-end and trainable. With the learned skeletal volumes, we propose two models, the Skeleton-Based GraphConvolutional Neural Network (SkeGCNN) and the Skeleton-Regularized Deep Implicit Surface Network (SkeDISN), which respectivelybuild upon and improve over the existing frameworks of explicit mesh deformation and implicit field learning for the downstream surfacereconstruction task. We conduct thorough experiments that verify the efficacy of our proposed SkeletonNet. SkeGCNN and SkeDISNoutperform existing methods as well, and they have their own merits when measured by different metrics. Additional results ingeneralized task settings further demonstrate the usefulness of our proposed methods. We have made both our implementation codeand the ShapeNet-Skeleton dataset publicly available at ble at https://github.com/tangjiapeng/SkeletonNet.

cs.CV↗

A flexible model-free prediction-based framework for feature ranking

Despite the availability of numerous statistical and machine learning tools for joint feature modeling, many scientists investigate features marginally, i.e., one feature at a time. This is partly due to training and convention but also roots in scientists' strong interests in simple visualization and interpretability. As such, marginal feature ranking for some predictive tasks, e.g., prediction of cancer driver genes, is widely practiced in the process of scientific discoveries. In this work, we focus on marginal ranking for binary prediction, the arguably most common predictive tasks. We argue that the most widely used marginal ranking criteria, including the Pearson correlation, the two-sample t test, and two-sample Wilcoxon rank-sum test, do not fully take feature distributions and prediction objectives into account. To address this gap in practice, we propose two ranking criteria corresponding to two prediction objectives: the classical criterion (CC) and the Neyman-Pearson criterion (NPC), both of which use model-free nonparametric implementations to accommodate diverse feature distributions. Theoretically, we show that under regularity conditions both criteria achieve sample-level ranking consistent with their population-level counterpart with high probability. Moreover, NPC is robust to sampling bias when the two class proportions in a sample deviate from those in the population. This property endows NPC good potential in biomedical research where sampling bias is common. We demonstrate the use and relative advantages of CC and NPC in simulation and real data studies. Our model-free objective-based ranking idea is extendable to ranking feature subsets and generalizable to other prediction tasks and learning objectives.

stat.ME↗

Group-Free 3D Object Detection via Transformers

Recently, directly detecting 3D objects from 3D point clouds has received increasing attention. To extract object representation from an irregular point cloud, existing methods usually take a point grouping step to assign the points to an object candidate so that a PointNet-like network could be used to derive object features from the grouped points. However, the inaccurate point assignments caused by the hand-crafted grouping scheme decrease the performance of 3D object detection. In this paper, we present a simple yet effective method for directly detecting 3D objects from the 3D point cloud. Instead of grouping local points to each object candidate, our method computes the feature of an object from all the points in the point cloud with the help of an attention mechanism in the Transformers \cite{vaswani2017attention}, where the contribution of each point is automatically learned in the network training. With an improved attention stacking scheme, our method fuses object features in different stages and generates more accurate object detection results. With few bells and whistles, the proposed method achieves state-of-the-art 3D object detection performance on two widely used benchmarks, ScanNet V2 and SUN RGB-D. The code and models are publicly available at \url{https://github.com/zeliu98/Group-Free-3D}

cs.CV↗

Bifurcation of the Maxwell quasinormal spectrum on asymptotically anti-de Sitter black holes

We study the Maxwell quasinormal spectrum on asymptotically anti-de Sitter black holes with a set of two Robin type boundary conditions, by requiring the energy flux to vanish at asymptotic infinity. Focusing, for illustrative purposes, on Schwarzschild-anti-de Sitter black holes both without and with a global monopole, we unveil that, on the one hand, the Maxwell quasinormal spectrum bifurcates as the black hole radius increases for both boundary conditions, which is termed the mode split effect; while on the other hand, with an appropriate fixed black hole radius but increasing the monopole parameter, the first (second) boundary condition may trigger (terminate) the mode split effect.

gr-qc↗

Deep Implicit Moving Least-Squares Functions for 3D Reconstruction

Point set is a flexible and lightweight representation widely used for 3D deep learning. However, their discrete nature prevents them from representing continuous and fine geometry, posing a major issue for learning-based shape generation. In this work, we turn the discrete point sets into smooth surfaces by introducing the well-known implicit moving least-squares (IMLS) surface formulation, which naturally defines locally implicit functions on point sets. We incorporate IMLS surface generation into deep neural networks for inheriting both the flexibility of point sets and the high quality of implicit surfaces. Our IMLSNet predicts an octree structure as a scaffold for generating MLS points where needed and characterizes shape geometry with learned local priors. Furthermore, our implicit function evaluation is independent of the neural network once the MLS points are predicted, thus enabling fast runtime evaluation. Our experiments on 3D object reconstruction demonstrate that IMLSNets outperform state-of-the-art learning-based methods in terms of reconstruction quality and computational efficiency. Extensive ablation tests also validate our network design and loss functions.

cs.CV↗

Learning and Exploring Motor Skills with Spacetime Bounds

Equipping characters with diverse motor skills is the current bottleneck of physics-based character animation. We propose a Deep Reinforcement Learning (DRL) framework that enables physics-based characters to learn and explore motor skills from reference motions. The key insight is to use loose space-time constraints, termed spacetime bounds, to limit the search space in an early termination fashion. As we only rely on the reference to specify loose spacetime bounds, our learning is more robust with respect to low quality references. Moreover, spacetime bounds are hard constraints that improve learning of challenging motion segments, which can be ignored by imitation-only learning. We compare our method with state-of-the-art tracking-based DRL methods. We also show how to guide style exploration within the proposed framework

cs.GR↗

Deformed Implicit Field: Modeling 3D Shapes with Learned Dense Correspondence

We propose a novel Deformed Implicit Field (DIF) representation for modeling 3D shapes of a category and generating dense correspondences among shapes. With DIF, a 3D shape is represented by a template implicit field shared across the category, together with a 3D deformation field and a correction field dedicated for each shape instance. Shape correspondences can be easily established using their deformation fields. Our neural network, dubbed DIF-Net, jointly learns a shape latent space and these fields for 3D objects belonging to a category without using any correspondence or part label. The learned DIF-Net can also provides reliable correspondence uncertainty measurement reflecting shape structure discrepancy. Experiments show that DIF-Net not only produces high-fidelity 3D shapes but also builds high-quality dense correspondences across different shapes. We also demonstrate several applications such as texture transfer and shape editing, where our method achieves compelling results that cannot be achieved by previous methods.

cs.CV↗

Marangoni Convection-Driven Laser Fountains and Waves on Free Surfaces of Liquids

It is well accepted that an outward Marangoni convection from a low surface tension region will make the surface depressed. Here, we report that this established perception is only valid for thin liquid films. Using surface laser heating, we show that in deep liquids a laser beam actually pulls up the fluid above the free surface generating fountains with different shapes. Whereas with decreasing liquid depth a transition from fountain to indentation with fountain in-indentation is observed. Further, high-speed imaging reveals a transient surface process before steady elevation is formed, and this dynamic deformation is subsequently utilized to resonantly excite giant surface waves by a modulated laser beam. Computational fluid dynamics models reveal the underlying flow patterns and quantify the depth-dependent and time-resolved surface deformations. Our discoveries and techniques have upended the century-old perception and opened up a new regime of interdisciplinary research and applications of Marangoni-induced interface phenomena and optocapillary fluidic surfaces-the control of fluids with light.

physics.flu-dyn↗

Unsupervised 3D Learning for Shape Analysis via Multiresolution Instance Discrimination

Although unsupervised feature learning has demonstrated its advantages to reducing the workload of data labeling and network design in many fields, existing unsupervised 3D learning methods still cannot offer a generic network for various shape analysis tasks with competitive performance to supervised methods. In this paper, we propose an unsupervised method for learning a generic and efficient shape encoding network for different shape analysis tasks. The key idea of our method is to jointly encode and learn shape and point features from unlabeled 3D point clouds. For this purpose, we adapt HR-Net to octree-based convolutional neural networks for jointly encoding shape and point features with fused multiresolution subnetworks and design a simple-yet-efficient Multiresolution Instance Discrimination (MID) loss for jointly learning the shape and point features. Our network takes a 3D point cloud as input and output both shape and point features. After training, the network is concatenated with simple task-specific back-end layers and fine-tuned for different shape analysis tasks. We evaluate the efficacy and generality of our method and validate our network and loss design with a set of shape analysis tasks, including shape classification, semantic shape segmentation, as well as shape registration tasks. With simple back-ends, our network demonstrates the best performance among all unsupervised methods and achieves competitive performance to supervised methods, especially in tasks with a small labeled dataset. For fine-grained shape segmentation, our method even surpasses existing supervised methods by a large margin.

cs.CV↗

Period Rings with Big Coefficients and Applications III

We continue our study on the corresponding period rings with big coefficients, with the corresponding application in mind on relative $p$-adic Hodge theory and noncommutative analytic geometry. In this article, we extend the discussion of the corresponding noncommutative descent over étale topology to the corresponding noncommutative descent over pro-étale topology in both Tate and analytic setting.

math.NT↗

Topics on Geometric and Representation Theoretic Aspects of Period Rings I

We consider more general framework than the corresponding one considered in our previous work on the Hodge-Iwasawa theory. In our current consideration we consider the corresponding more general base spaces, namely the analytic adic spaces and analytic perfectoid spaces in Kedlaya's AWS Lecture notes. We hope our discussion will also shed some light on further generalization to even more general spaces such as those considered by Gabber-Ramero namely one just considers certain topological rings which satisfy the Fontaine-Wintenberger idempotent correspondence and calls them perfectoid generalizing the notions from Scholze, Fontaine, Kedlaya-Liu and Kedlaya (AWS Lecture notes). Actually some of the discussion we presented here is already in some more general form for this purpose (although we have not made enough efforts to write all the things).

math.NT↗

Topologization and Functional Analytification I: Intrinsic Morphisms of Commutative Algebras

Eventually after Dieudonné-Grothendieck, we give intrinsic definitions of étale, lisse and non-ramifié morphisms for general adic rings and general locally convex rings. And we investigate the corresponding étale-like, lisse-like and non-ramifié-like morphisms for general $\infty$-Banach, $\infty$-Borné and $\infty$-ind-Fréchet $\infty$-rings and $\infty$-functors into $\infty$-groupoid (as in the work of Bambozzi-Ben-Bassat-Kremnizer) in some intrinsic way by using the corresponding infinitesimal stacks and crystalline stacks. The two directions of generalization will intersect at Huber's book in the strongly noetherian situation.

math.NT↗

Analytic Geometry and Hodge-Frobenius Structure Continued

This is our sequel to our previous work on the corresponding generalized Frobenius modules over some big multivariate Robba rings. We will go beyond our previous discussion where we focused on the corresponding analytic functions on polydiscs and polyannuli in the strictly affinoid situation, and general Hodge-Frobenius structures which are admissible in the corresponding context in our previous work.

math.NT↗

Period Rings with Big Coefficients and Application II

We continue our study on the corresponding noncommutative deformation of the relative $p$-adic Hodge structures of Kedlaya-Liu along our previous work. In this paper, we are going to initiate the study of the corresponding descent of pseudocoherent modules carrying large noncommutative coefficients. And also we are going to more systematically study the corresponding noncommutative geometric aspects of noncommutative deformation of Hodge structures, which will definitely also provide the insights not only for noncommutative Iwasawa theory but also for noncommutative analytic geometry. The noncommutative Hodge-Iwasawa theory is now improved along some very well-defined direction (we will expect many well-targeted applications to noncommutative Tamagawa number conjectures from the modern perspectives of Burns-Flach-Fukaya-Kato), while the corresponding Kedlaya-Liu glueing of pseudocoherent Banach modules with certain stability is also generalized to the large noncommutative coefficient case.

math.NT↗

Bridging Cost-sensitive and Neyman-Pearson Paradigms for Asymmetric Binary Classification

Asymmetric binary classification problems, in which the type I and II errors have unequal severity, are ubiquitous in real-world applications. To handle such asymmetry, researchers have developed the cost-sensitive and Neyman-Pearson paradigms for training classifiers to control the more severe type of classification error, say the type I error. The cost-sensitive paradigm is widely used and has straightforward implementations that do not require sample splitting; however, it demands an explicit specification of the costs of the type I and II errors, and an open question is what specification can guarantee a high-probability control on the population type I error. In contrast, the Neyman-Pearson paradigm can train classifiers to achieve a high-probability control of the population type I error, but it relies on sample splitting that reduces the effective training sample size. Since the two paradigms have complementary strengths, it is reasonable to combine their strengths for classifier construction. In this work, we for the first time study the methodological connections between the two paradigms, and we develop the TUBE-CS algorithm to bridge the two paradigms from the perspective of controlling the population type I error.

stat.ML↗

Category and Cohomology of Hodge-Iwasawa Modules

In this paper we study the corresponding categories and the corresponding cohomologies of the Hodge-Iwasawa modules we developed in our series papers on Hodge-Iwasawa theory. The corresponding cohomologies will be essential in the corresponding development of the contact with the corresponding Iwasawa theoretic consideration, while they are as well very crucial in the corresponding study of the corresponding deformations of local systems over general analytic spaces. We contact with some applications in analytic geometry and arithmetic geometry which all have their own interests and deserve further study for us in the future, including local systems over general analytic spaces after Kedlaya-Liu, arithmetic Riemann-Hilbert correspondence in families after Liu-Zhu, and equivariant Iwasawa theory and geometrization of equivariant Iwasawa theory after Berger-Fourquaux and Nakamura.

math.AG↗

Period Rings with Big Coefficients and Applications I

Following ideas of Kedlaya-Liu, we are going to consider extending our previous work to the context of more general adic spaces, which will be corresponding deformation of the relative $p$-adic Hodge structure over more general adic spaces. This means that the deformation could be also realized by an adic spaces (perfectoid, preperfectoid, relatively perfectoid and so on). Parts of the whole project here actually are inspired by the corresponding Drinfeld's lemma for diamonds after Scholze, as well as the work from Carter-Kedlaya-Zábrádi which is aimed at studying the representation theory of products of étale fundamental groups. Moreover, we gain motivations from noncommutative analytic geometries and noncommutative Tamagawa number conjectures.

math.NT↗