Search arXiv⌕ Search

arXiv subjects

Chang Liu

Publications and source records attributed to Chang Liu.

At least 667 records · Page 37Linked to original sources

Explicit design optimization of air rudders for maximizing stiffness and fundamental frequency

In aerospace engineering, there is a growing demand for lightweight design through topology optimization. This paper presents a novel design optimization method for stiffened air rudders, commonly used for aircraft attitude control, based on the Moving Morphable Components (MMC) method. The stiffeners within the irregular enclosed design domain are modeled as MMCs and discretized by shell elements, accurately capturing their geometry and evolution during optimization process using explicit parameters. In order to maximize the stiffness and fundamental frequency of the rudder structures, numerical analysis algorithms were developed with shape sensitivity analysis conducted. To comply with the manufacturing requirement, a minimum thickness is prescribed for the stiffeners. Penalty strategies were developed for the thickness and density of stiffeners with thickness smaller than the threshold to meet the thickness requirement and suppress spurious modes. The method's effectiveness was demonstrated through optimization examples of two typical air rudders, illustrating the significance of stiffener's distribution on design objectives. The explicit modeling characteristics allow for directly importing the optimization results into CAD systems, significantly enhancing the engineering applicability.

math.OC↗

Interleaved Training for Massive MIMO Downlink via Exploring Spatial Correlation

Interleaved training has been studied for single-user and multi-user massive MIMO downlink with either fully-digital or hybrid beamforming. However, the impact of channel correlation on its average training overhead is rarely addressed. In this paper, we explore the channel correlation to improve the interleaved training for single-user massive MIMO downlink. For the beam-domain interleaved training, we propose a modified scheme by optimizing the beam training codebook. The basic antenna-domain interleaved training is also improved by dynamically adjusting the training order of the base station (BS) antennas during the training process based on the values of the already trained channels. Exact and simplified approximate expressions of the average training length are derived in closed-form for the basic and modified beam-domain schemes and the basic antenna-domain scheme in correlated channels. For the modified antenna-domain scheme, a deep neural network (DNN)-based approximation is provided for fast performance evaluation. Analytical results and simulations verify the accuracy of our derived training length expressions and explicitly reveal the impact of system parameters on the average training length. In addition, the modified beam/antenna-domain schemes are shown to have a shorter average training length compared to the basic schemes.

cs.IT↗

Optimally Blending Honeypots into Production Networks: Hardness and Algorithms

Honeypot is an important cyber defense technique that can expose attackers new attacks. However, the effectiveness of honeypots has not been systematically investigated, beyond the rule of thumb that their effectiveness depends on how they are deployed. In this paper, we initiate a systematic study on characterizing the cybersecurity effectiveness of a new paradigm of deploying honeypots: blending honeypot computers (or IP addresses) into production computers. This leads to the following Honeypot Deployment (HD) problem, How should the defender blend honeypot computers into production computers to maximize the utility in forcing attackers to expose their new attacks while minimizing the loss to the defender in terms of the digital assets stored in the compromised production computers? We formalize HD as a combinatorial optimization problem, prove its NP hardness, provide a near optimal algorithm (i.e., polynomial time approximation scheme). We also conduct simulations to show the impact of attacker capabilities.

cs.CR↗

Foundation Model for Endoscopy Video Analysis via Large-scale Self-supervised Pre-train

Foundation models have exhibited remarkable success in various applications, such as disease diagnosis and text report generation. To date, a foundation model for endoscopic video analysis is still lacking. In this paper, we propose Endo-FM, a foundation model specifically developed using massive endoscopic video data. First, we build a video transformer, which captures both local and global long-range dependencies across spatial and temporal dimensions. Second, we pre-train our transformer model using global and local views via a self-supervised manner, aiming to make it robust to spatial-temporal variations and discriminative across different scenes. To develop the foundation model, we construct a large-scale endoscopy video dataset by combining 9 publicly available datasets and a privately collected dataset from Baoshan Branch of Renji Hospital in Shanghai, China. Our dataset overall consists of over 33K video clips with up to 5 million frames, encompassing various protocols, target organs, and disease types. Our pre-trained Endo-FM can be easily adopted for a given downstream task via fine-tuning by serving as the backbone. With experiments on 3 different types of downstream tasks, including classification, segmentation, and detection, our Endo-FM surpasses the current state-of-the-art (SOTA) self-supervised pre-training and adapter-based transfer learning methods by a significant margin, such as VCL (3.1% F1, 4.8% Dice, and 5.5% F1 for classification, segmentation, and detection) and ST-Adapter (5.9% F1, 9.6% Dice, and 9.9% F1 for classification, segmentation, and detection). Code, datasets, and models are released at https://github.com/med-air/Endo-FM.

cs.CV↗

Observation of plaid-like spin splitting in a noncoplanar antiferromagnet

Spatial, momentum and energy separation of electronic spins in condensed matter systems guides the development of novel devices where spin-polarized current is generated and manipulated. Recent attention on a set of previously overlooked symmetry operations in magnetic materials leads to the emergence of a new type of spin splitting, enabling giant and momentum-dependent spin polarization of energy bands on selected antiferromagnets. Despite the ever-growing theoretical predictions, the direct spectroscopic proof of such spin splitting is still lacking. Here, we provide solid spectroscopic and computational evidence for the existence of such materials. In the noncoplanar antiferromagnet MnTe$_2$, the in-plane components of spin are found to be antisymmetric about the high-symmetry planes of the Brillouin zone, comprising a plaid-like spin texture in the antiferromagnetic (AFM) ground state. Such an unconventional spin pattern, further found to diminish at the high-temperature paramagnetic state, stems from the intrinsic AFM order instead of spin-orbit coupling (SOC). Our finding demonstrates a new type of quadratic spin texture induced by time-reversal breaking, placing AFM spintronics on a firm basis and paving the way for studying exotic quantum phenomena in related materials.

cond-mat.mtrl-sci↗

Unified gas-kinetic wave-particle method for frequency-dependent radiation transport equation

The multi-frequency radiation transport equation (RTE) system models the photon transport and the energy exchange process between the background material and different frequency photons. In this paper, the unified gas-kinetic wave-particle (UGKWP) method for multi-frequency RTE is developed to capture the multiscale non-equilibrium transport in different optical regimes. In the UGKWP, a multiscale evolution process is properly designed to obtain both non-equilibrium transport in the optically thin regime and thermal diffusion process in the optically thick regime automatically. At the same time, the coupled macroscopic energy equations for the photon and material are solved implicitly by the matrix-free source iteration method. With the wave-particle decomposition strategy, the UGKWP method has a dynamic adaptivity for different regime physics. In the optically thick regime, no particles will be sampled in the computational domain and the thermal diffusion solution for the photon transport will be recovered. While in the optically thin regime, stochastic particles will play a dominant role in the evolution and the non-equilibrium free transport of photon is automatically followed. In the frequency-dependent transport, the frequency carried by the simulating particle will be determined by a linear-frequency sampling strategy. In addition, to better resolve the sharp of opacity in the photon transport across a cell interface, the free streaming time of simulating particle in the UGKWP method will be reset when it passes through the interface. Moreover, the numerical relaxation time is properly defined to increase the particle proportion in the sharp opacity transition region in order to avoid numerical oscillation. Several typical test cases for the RTE system have been calculated to demonstrate the accuracy and reliability of the current frequency-dependent UGKWP method.

physics.comp-ph↗

Learning Spatially Collaged Fourier Bases for Implicit Neural Representation

Existing approaches to Implicit Neural Representation (INR) can be interpreted as a global scene representation via a linear combination of Fourier bases of different frequencies. However, such universal basis functions can limit the representation capability in local regions where a specific component is unnecessary, resulting in unpleasant artifacts. To this end, we introduce a learnable spatial mask that effectively dispatches distinct Fourier bases into respective regions. This translates into collaging Fourier patches, thus enabling an accurate representation of complex signals. Comprehensive experiments demonstrate the superior reconstruction quality of the proposed approach over existing baselines across various INR tasks, including image fitting, video representation, and 3D shape representation. Our method outperforms all other baselines, improving the image fitting PSNR by over 3dB and 3D reconstruction to 98.81 IoU and 0.0011 Chamfer Distance.

cs.CV↗

GREC: Generalized Referring Expression Comprehension

The objective of Classic Referring Expression Comprehension (REC) is to produce a bounding box corresponding to the object mentioned in a given textual description. Commonly, existing datasets and techniques in classic REC are tailored for expressions that pertain to a single target, meaning a sole expression is linked to one specific object. Expressions that refer to multiple targets or involve no specific target have not been taken into account. This constraint hinders the practical applicability of REC. This study introduces a new benchmark termed as Generalized Referring Expression Comprehension (GREC). This benchmark extends the classic REC by permitting expressions to describe any number of target objects. To achieve this goal, we have built the first large-scale GREC dataset named gRefCOCO. This dataset encompasses a range of expressions: those referring to multiple targets, expressions with no specific target, and the single-target expressions. The design of GREC and gRefCOCO ensures smooth compatibility with classic REC. The proposed gRefCOCO dataset, a GREC method implementation code, and GREC evaluation code are available at https://github.com/henghuiding/gRefCOCO.

cs.CV↗

Strongly-Lensed Extreme Mass-ratio Inspirals

In this work, we investigate detection rates and parameter estimation of strongly-lensed extreme mass-ratio inspirals (LEMRIs) in the context of the Laser Interferometer Space Antenna (LISA). Our results indicate that LEMRIs constitute a new gravitational-wave target signal for LISA, with detection rates ranging from zero to $\sim 40$ events over a four year-observation, and that it is possible to reveal and characterize LEMRIs at redshift $z \gtrsim 1$. We finally show that one LEMRI observation with identified host galaxy may yield percent constraints or better on the Hubble constant.

astro-ph.CO↗

iDesigner: A High-Resolution and Complex-Prompt Following Text-to-Image Diffusion Model for Interior Design

With the open-sourcing of text-to-image models (T2I) such as stable diffusion (SD) and stable diffusion XL (SD-XL), there is an influx of models fine-tuned in specific domains based on the open-source SD model, such as in anime, character portraits, etc. However, there are few specialized models in certain domains, such as interior design, which is attributed to the complex textual descriptions and detailed visual elements inherent in design, alongside the necessity for adaptable resolution. Therefore, text-to-image models for interior design are required to have outstanding prompt-following capabilities, as well as iterative collaboration with design professionals to achieve the desired outcome. In this paper, we collect and optimize text-image data in the design field and continue training in both English and Chinese on the basis of the open-source CLIP model. We also proposed a fine-tuning strategy with curriculum learning and reinforcement learning from CLIP feedback to enhance the prompt-following capabilities of our approach so as to improve the quality of image generation. The experimental results on the collected dataset demonstrate the effectiveness of the proposed approach, which achieves impressive results and outperforms strong baselines.

cs.CV↗

GMTR: Graph Matching Transformers

Vision transformers (ViTs) have recently been used for visual matching beyond object detection and segmentation. However, the original grid dividing strategy of ViTs neglects the spatial information of the keypoints, limiting the sensitivity to local information. Therefore, we propose QueryTrans (Query Transformer), which adopts a cross-attention module and keypoints-based center crop strategy for better spatial information extraction. We further integrate the graph attention module and devise a transformer-based graph matching approach GMTR (Graph Matching TRansformers) whereby the combinatorial nature of GM is addressed by a graph transformer neural GM solver. On standard GM benchmarks, GMTR shows competitive performance against the SOTA frameworks. Specifically, on Pascal VOC, GMTR achieves $\mathbf{83.6\%}$ accuracy, $\mathbf{0.9\%}$ higher than the SOTA framework. On Spair-71k, GMTR shows great potential and outperforms most of the previous works. Meanwhile, on Pascal VOC, QueryTrans improves the accuracy of NGMv2 from $80.1\%$ to $\mathbf{83.3\%}$, and BBGM from $79.0\%$ to $\mathbf{84.5\%}$. On Spair-71k, QueryTrans improves NGMv2 from $80.6\%$ to $\mathbf{82.5\%}$, and BBGM from $82.1\%$ to $\mathbf{83.9\%}$. Source code will be made publicly available.

cs.CV↗

Future-proofing geotechnics workflows: accelerating problem-solving with large language models

The integration of Large Language Models (LLMs) like ChatGPT into the workflows of geotechnical engineering has a high potential to transform how the discipline approaches problem-solving and decision-making. This paper delves into the innovative application of LLMs in geotechnical engineering, as explored in a hands-on workshop held in Tokyo, Japan. The event brought together a diverse group of 20 participants, including students, researchers, and professionals from academia, industry, and government sectors, to investigate practical uses of LLMs in addressing specific geotechnical challenges. The workshop facilitated the creation of solutions for four different practical geotechnical problems as illustrative examples, culminating in the development of an academic paper. The paper discusses the potential of LLMs to transform geotechnical engineering practices, highlighting their proficiency in handling a range of tasks from basic data analysis to complex, multimodal problem-solving. It also addresses the challenges in implementing LLMs, particularly in achieving high precision and accuracy in specialized tasks, and underscores the need for expert oversight. The findings demonstrate LLMs' effectiveness in enhancing efficiency, data processing, and decision-making in geotechnical engineering, suggesting a paradigm shift towards more integrated, data-driven approaches in this field. This study not only showcases the potential of LLMs in a specific engineering domain, but also sets a precedent for their broader application in interdisciplinary research and practice, where the synergy of human expertise and artificial intelligence redefines the boundaries of problem-solving.

cs.LG↗

Transforms for Multiplicative and Fractional Programming with Broad Applications in Edge Computing and Communication Networks

Multiplicative Programming (MP) pertains to a spectrum of optimization problems that involve product term(s). As computational paradigms of communication systems continue to evolve, particularly concerning the offloading strategies of computationally intensive tasks simultaneously to centralized or decentralized servers, designing or optimizing effective communication systems with MP techniques becomes increasingly indispensable. Similarly, Fractional Programming (FP) is another significant branch in the optimization domain, addressing various essential scenarios in communication. For instance, in minimization optimization problems, transmission power and processing delay of communication systems are considered critical metrics. In a very recent JSAC paper by Zhao et al. [2], an innovative transform (Zhao's Optimization Transform) was proposed for solving the minimization of MP and FP problems. Nevertheless, the resolution of optimization problems in communication systems encounters several limitations when adopting Zhao's optimization transform, especially in MP problems. Primarily, objective functions proposed in these optimization problems typically involve sum-of-products terms and the optimization variables are always discrete leading to NP-hard problems. Furthermore, multiple functions mapping to the non-negative domain in these scenarios can result in auxiliary variables being zero values, while the same situation is avoidable in FP problems due to the presence of these functions in the denominator. In this paper, we introduce an updated transform, building on the foundations of Zhao's original method, designed to effectively overcome these challenges by reformulating the original problem into a series of convex or concave problems. This introduced problem reformulation provides a superior iteration algorithm with demonstrable convergence to a stationary point.

cs.CC↗

Optimization for the Metaverse over Mobile Edge Computing with Play to Earn

The concept of the Metaverse has garnered growing interest from both academic and industry circles. The decentralization of both the integrity and security of digital items has spurred the popularity of play-to-earn (P2E) games, where players are entitled to earn and own digital assets which they may trade for physical-world currencies. However, these computationally-intensive games are hardly playable on resource-limited mobile devices and the computational tasks have to be offloaded to an edge server. Through mobile edge computing (MEC), users can upload data to the Metaverse Service Provider (MSP) edge servers for computing. Nevertheless, there is a trade-off between user-perceived in-game latency and user visual experience. The downlink transmission of lower-resolution videos lowers user-perceived latency while lowering the visual fidelity and consequently, earnings of users. In this paper, we design a method to enhance the Metaverse-based mobile augmented reality (MAR) in-game user experience. Specifically, we formulate and solve a multi-objective optimization problem. Given the inherent NP-hardness of the problem, we present a low-complexity algorithm to address it, mitigating the trade-off between delay and earnings. The experiment results show that our method can effectively balance the user-perceived latency and profitability, thus improving the performance of Metaverse-based MAR systems.

cs.DC↗

Fixed-flux Rayleigh-Bénard convection in doubly periodic domains: generation of large-scale shear

This work studies two-dimensional fixed-flux Rayleigh-Bénard convection with periodic boundary conditions in both horizontal and vertical directions and analyzes its dynamics using numerical continuation, secondary instability analysis and direct numerical simulation. The fixed-flux constraint leads to time-independent elevator modes with a well-defined amplitude. Secondary instability of these modes leads to tilted elevator modes accompanied by horizontal shear flow. For $Pr$=1, where $Pr$ is the Prandtl number, a subsequent subcritical Hopf bifurcation leads to hysteresis behavior between this state and a time-dependent direction-reversing state, followed by a global bifurcation leading to modulated traveling waves without flow reversal. Single-mode equations reproduce this moderate Rayleigh number behavior well. At high Rayleigh numbers, chaotic behavior dominated by modulated traveling waves appears. These transitions are characteristic of high wavenumber elevator modes since the vertical wavenumber of the secondary instability is linearly proportional to the horizontal wavenumber of the elevator mode. At a low $Pr$, relaxation oscillations between the conduction state and the elevator mode appear, followed by quasiperiodic and chaotic behavior as the Rayleigh number increases. In the high $Pr$ regime, the large-scale shear weakens, and the flow shows bursting behavior that can lead to significantly increased heat transport or even intermittent stable stratification.

physics.flu-dyn↗

FreestyleRet: Retrieving Images from Style-Diversified Queries

Image Retrieval aims to retrieve corresponding images based on a given query. In application scenarios, users intend to express their retrieval intent through various query styles. However, current retrieval tasks predominantly focus on text-query retrieval exploration, leading to limited retrieval query options and potential ambiguity or bias in user intention. In this paper, we propose the Style-Diversified Query-Based Image Retrieval task, which enables retrieval based on various query styles. To facilitate the novel setting, we propose the first Diverse-Style Retrieval dataset, encompassing diverse query styles including text, sketch, low-resolution, and art. We also propose a light-weighted style-diversified retrieval framework. For various query style inputs, we apply the Gram Matrix to extract the query's textural features and cluster them into a style space with style-specific bases. Then we employ the style-init prompt tuning module to enable the visual encoder to comprehend the texture and style information of the query. Experiments demonstrate that our model, employing the style-init prompt tuning strategy, outperforms existing retrieval models on the style-diversified retrieval task. Moreover, style-diversified queries~(sketch+text, art+text, etc) can be simultaneously retrieved in our model. The auxiliary information from other queries enhances the retrieval performance within the respective query.

cs.CV↗

Resource Allocation of Federated Learning for the Metaverse with Mobile Augmented Reality

The Metaverse has received much attention recently. Metaverse applications via mobile augmented reality (MAR) require rapid and accurate object detection to mix digital data with the real world. Federated learning (FL) is an intriguing distributed machine learning approach due to its privacy-preserving characteristics. Due to privacy concerns and the limited computation resources on mobile devices, we incorporate FL into MAR systems of the Metaverse to train a model cooperatively. Besides, to balance the trade-off between energy, execution latency and model accuracy, thereby accommodating different demands and application scenarios, we formulate an optimization problem to minimize a weighted combination of total energy consumption, completion time and model accuracy. Through decomposing the non-convex optimization problem into two subproblems, we devise a resource allocation algorithm to determine the bandwidth allocation, transmission power, CPU frequency and video frame resolution for each participating device. We further present the convergence analysis and computational complexity of the proposed algorithm. Numerical results show that our proposed algorithm has better performance (in terms of energy consumption, completion time and model accuracy) under different weight parameters compared to existing benchmarks.

cs.LG↗

Detecting Voice Cloning Attacks via Timbre Watermarking

Nowadays, it is common to release audio content to the public. However, with the rise of voice cloning technology, attackers have the potential to easily impersonate a specific person by utilizing his publicly released audio without any permission. Therefore, it becomes significant to detect any potential misuse of the released audio content and protect its timbre from being impersonated. To this end, we introduce a novel concept, "Timbre Watermarking", which embeds watermark information into the target individual's speech, eventually defeating the voice cloning attacks. To ensure the watermark is robust to the voice cloning model's learning process, we design an end-to-end voice cloning-resistant detection framework. The core idea of our solution is to embed and extract the watermark in the frequency domain in a temporally invariant manner. To acquire generalization across different voice cloning attacks, we modulate their shared process and integrate it into our framework as a distortion layer. Experiments demonstrate that the proposed timbre watermarking can defend against different voice cloning attacks, exhibit strong resistance against various adaptive attacks (e.g., reconstruction-based removal attacks, watermark overwriting attacks), and achieve practicality in real-world services such as PaddleSpeech, Voice-Cloning-App, and so-vits-svc. In addition, ablation studies are also conducted to verify the effectiveness of our design. Some audio samples are available at https://timbrewatermarking.github.io/samples.

cs.SD↗