Searcharxiv⌕ Search

arXiv subjects

Qi Wang

Publications and source records attributed to Qi Wang.

At least 397 records · Page 22Linked to original sources

PrivShape: Extracting Shapes in Time Series under User-Level Local Differential Privacy

Time series have numerous applications in finance, healthcare, IoT, and smart city. In many of these applications, time series typically contain personal data, so privacy infringement may occur if they are released directly to the public. Recently, local differential privacy (LDP) has emerged as the state-of-the-art approach to protecting data privacy. However, existing works on LDP-based collections cannot preserve the shape of time series. A recent work, PatternLDP, attempts to address this problem, but it can only protect a finite group of elements in a time series due to ω-event level privacy guarantee. In this paper, we propose PrivShape, a trie-based mechanism under user-level LDP to protect all elements. PrivShape first transforms a time series to reduce its length, and then adopts trie-expansion and two-level refinement to improve utility. By extensive experiments on real-world datasets, we demonstrate that PrivShape outperforms PatternLDP when adapted for offline use, and can effectively extract frequent shapes.

cs.CR↗

Towards Inclusive Video Commenting: Introducing Signmaku for the Deaf and Hard-of-Hearing

Previous research underscored the potential of danmaku--a text-based commenting feature on videos--in engaging hearing audiences. Yet, for many Deaf and hard-of-hearing (DHH) individuals, American Sign Language (ASL) takes precedence over English. To improve inclusivity, we introduce "Signmaku," a new commenting mechanism that uses ASL, serving as a sign language counterpart to danmaku. Through a need-finding study (N=12) and a within-subject experiment (N=20), we evaluated three design styles: real human faces, cartoon-like figures, and robotic representations. The results showed that cartoon-like signmaku not only entertained but also encouraged participants to create and share ASL comments, with fewer privacy concerns compared to the other designs. Conversely, the robotic representations faced challenges in accurately depicting hand movements and facial expressions, resulting in higher cognitive demands on users. Signmaku featuring real human faces elicited the lowest cognitive load and was the most comprehensible among all three types. Our findings offered novel design implications for leveraging generative AI to create signmaku comments, enriching co-learning experiences for DHH individuals.

cs.HC↗

PeerGPT: Probing the Roles of LLM-based Peer Agents as Team Moderators and Participants in Children's Collaborative Learning

In children's collaborative learning, effective peer conversations can significantly enhance the quality of children's collaborative interactions. The integration of Large Language Model (LLM) agents into this setting explores their novel role as peers, assessing impacts as team moderators and participants. We invited two groups of participants to engage in a collaborative learning workshop, where they discussed and proposed conceptual solutions to a design problem. The peer conversation transcripts were analyzed using thematic analysis. We discovered that peer agents, while managing discussions effectively as team moderators, sometimes have their instructions disregarded. As participants, they foster children's creative thinking but may not consistently provide timely feedback. These findings highlight potential design improvements and considerations for peer agents in both roles.

cs.HC↗

All-magnonic repeater based on bistability

Bistability, a universal phenomenon found in diverse fields such as biology, chemistry, and physics, describes a scenario in which a system has two stable equilibrium states and resets to one of the two states. The ability to switch between these two states is the basis for a wide range of applications, particularly in memory and logic operations. Here, we present a universal approach to achieve bistable switching in magnonics, the field processing data using spin waves. As an exemplary application, we use magnonic bistability to experimentally demonstrate the still missing magnonic repeater. A pronounced bistable window is observed in a 1um wide magnonic conduit under an external rf drive characterized by two magnonic stable states defined as low and high spin-wave amplitudes. The switching between these two states is realized by another propagating spin wave sent into the rf driven region. This magnonic bistable switching is used to design the magnonic repeater, which receives the original decayed and distorted spin wave and regenerates a new spin wave with amplified amplitude and normalized phase. Our magnonic repeater is proposed to be installed at the inputs of each magnonic logic gate to overcome the spin-wave amplitude degradation and phase distortion during previous propagation and achieve integrated magnonic circuits or magnonic neuromorphic networks.

physics.app-ph↗

EMIE-MAP: Large-Scale Road Surface Reconstruction Based on Explicit Mesh and Implicit Encoding

Road surface reconstruction plays a vital role in autonomous driving systems, enabling road lane perception and high-precision mapping. Recently, neural implicit encoding has achieved remarkable results in scene representation, particularly in the realistic rendering of scene textures. However, it faces challenges in directly representing geometric information for large-scale scenes. To address this, we propose EMIE-MAP, a novel method for large-scale road surface reconstruction based on explicit mesh and implicit encoding. The road geometry is represented using explicit mesh, where each vertex stores implicit encoding representing the color and semantic information. To overcome the difficulty in optimizing road elevation, we introduce a trajectory-based elevation initialization and an elevation residual learning method based on Multi-Layer Perceptron (MLP). Additionally, by employing implicit encoding and multi-camera color MLPs decoding, we achieve separate modeling of scene physical properties and camera characteristics, allowing surround-view reconstruction compatible with different camera models. Our method achieves remarkable road surface reconstruction performance in a variety of real-world challenging scenarios.

cs.CV↗

Demystifying the DAO Governance Process

Decentralized Autonomous Organization (DAO) becomes a popular governance solution for decentralized applications (dApps) to achieve decentralized governance. In the DAO, no single entity can arbitrarily control the dApps without approval from the majority of members. However, despite its advantages, DAO has also been targeted by several attacks, leading to the loss of millions of dollars. In this paper, we first provided an overview of the DAO governance process within the blockchain. Next, we identified the issues within three components of governance process: Governance Contract, Documentation, and Proposal. Each of these components is vulnerable to issues that could potentially result in substantial financial losses. Then we developed automated methods to detected above issues. To investigate the issues within the existing DAO ecosystem, we constructed a state-of-the-art dataset that includes 16,427 DAOs, 183 documentation, and 122,307 proposals across 9 different blockchains. Our analysis reveals that a majority of DAO developers and members have not given sufficient attention to these issues, especially in the area of proposal. The result shows that over 60% of the examined proposals fail to provide a consistent description and code for their members, highlighting a significant gap in ensuring transparency within the DAO governance process. For a better DAO governance ecosystem, DAO developers and members can utilize the methods to identify and address issues within governance process.

cs.SE↗

A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems

A stochastic-gradient-based interior-point algorithm for minimizing a continuously differentiable objective function (that may be nonconvex) subject to bound constraints is presented, analyzed, and demonstrated through experimental results. The algorithm is unique from other interior-point methods for solving smooth nonconvex optimization problems since the search directions are computed using stochastic gradient estimates. It is also unique in its use of inner neighborhoods of the feasible region -- defined by a positive and vanishing neighborhood-parameter sequence -- in which the iterates are forced to remain. It is shown that with a careful balance between the barrier, step-size, and neighborhood sequences, the proposed algorithm satisfies convergence guarantees in both deterministic and stochastic settings. The results of numerical experiments show that in both settings the algorithm can outperform projection-based methods.

math.OC↗

Effects of diffusion and advection on predator prey dynamics in an advective patchy environment

In this paper, we consider a specialist predator-prey patchy model over the closed stream network. We study the dynamics and the asymptotic profiles of positive steady states according to the mortality rate of the specialist predators, advection and diffusion rates. We verify that the specialist predators can successfully invade as long as the mortality rate is sufficiently small. On the other hand, the impacts of diffusion and advection on the asymptotic profiles of positive steady states and on the concentration of the species are given.

q-bio.PE↗

Affine flag varieties of type D

The Hecke algebras and quantum group of affine type A admit geometric realizations in terms of complete flags and partial flags over a local field, respectively. Subsequently, it is demonstrated that the quantum group associated to partial flag varieties of affine type C is a coideal subalgebra of quantum group of affine type A. In this paper, we establish a lattice presentation of the complete (partial) flag varieties of affine type D. Additionally, we determine the structures of convolution algebra associated to complete flag varieties of affine type D, which is isomorphic to the (extended) affine Hecke algebra. We also show that there exists a monomial basis and a canonical basis of the convolution algebra, and establish the positivity properties of the canonical basis with respect to multiplication.

math.RT↗

Exploring Advanced Methodologies in Security Evaluation for LLMs

Large Language Models (LLMs) represent an advanced evolution of earlier, simpler language models. They boast enhanced abilities to handle complex language patterns and generate coherent text, images, audios, and videos. Furthermore, they can be fine-tuned for specific tasks. This versatility has led to the proliferation and extensive use of numerous commercialized large models. However, the rapid expansion of LLMs has raised security and ethical concerns within the academic community. This emphasizes the need for ongoing research into security evaluation during their development and deployment. Over the past few years, a substantial body of research has been dedicated to the security evaluation of large-scale models. This article an in-depth review of the most recent advancements in this field, providing a comprehensive analysis of commonly used evaluation metrics, advanced evaluation frameworks, and the routine evaluation processes for LLMs. Furthermore, we also discuss the future directions for advancing the security evaluation of LLMs.

cs.CR↗

On the maximum size of variable-length non-overlapping codes

Non-overlapping codes are a set of codewords such that the prefix of each codeword is not a suffix of any codeword in the set, including itself. If the lengths of the codewords are variable, it is additionally required that every codeword is not contained in any other codeword as a subword. Let $C(n,q)$ be the maximum size of $q$-ary fixed-length non-overlapping codes of length $n$. The upper bound on $C(n,q)$ has been well studied. However, the nontrivial upper bound on the maximum size of variable-length non-overlapping codes of length at most $n$ remains open. In this paper, by establishing a link between variable-length non-overlapping codes and fixed-length ones, we are able to show that the size of a $q$-ary variable-length non-overlapping code is upper bounded by $C(n,q)$. Furthermore, we prove that the average length of the codewords in a $q$-ary variable-length non-overlapping codes is lower bounded by $\lceil \log_q \tilde{C} \rceil$, and is asymptotically no shorter than $n-2$ as $q$ approaches $\infty$, where $\tilde{C}$ denotes the cardinality of $q$-ary variable-length non-overlapping codes of length up to $n$.

cs.IT↗

Steiner systems $S(2,4,2^m)$ supported by a family of extended cyclic codes

In [C. Ding, An infinite family of Steiner systems $S(2,4,2^m)$ from cyclic codes, {\em J. Combin. Des.} 26 (2018), no.3, 126--144], Ding constructed a family of Steiner systems $S(2,4,2^m)$ for all $m \equiv 2 \pmod{4}$ from a family of extended cyclic codes. The objective of this paper is to present a family of Steiner systems $S(2,4,2^m)$ for all $m \equiv 0 \pmod{4}$ supported by a family of extended cyclic codes. The main result of this paper complements the previous work of Ding, and the results in the two papers will show that there exists a binary extended cyclic code that can support a Steiner system $S(2,4,2^m)$ for all even $m \geq 4$. This paper also determines the parameters of other $2$-designs supported by this family of extended cyclic codes.

math.CO↗

On the size distribution of Levenshtein balls with radius one

The fixed length Levenshtein (FLL) distance between two words $\mathbf{x,y} \in \mathbb{Z}_m^n$ is the smallest integer $t$ such that $\mathbf{x}$ can be transformed to $\mathbf{y}$ by $t$ insertions and $t$ deletions. The size of a ball in FLL metric is a fundamental but challenging problem. Very recently, Bar-Lev, Etzion, and Yaakobi explicitly determined the minimum, maximum and average sizes of the FLL balls with radius one. In this paper, based on these results, we further prove that the size of the FLL balls with radius one is highly concentrated around its mean by Azuma's inequality.

cs.IT↗

Magnetic anisotropy and GGG substrate stray field in YIG films down to millikelvin temperatures

Quantum magnonics investigates the quantum-mechanical properties of magnons such as quantum coherence or entanglement for solid-state quantum information technologies at the nanoscale. The most promising material for quantum magnonics is the ferrimagnetic yttrium iron garnet (YIG), which hosts magnons with the longest lifetimes. YIG films of the highest quality are grown on a paramagnetic gadolinium gallium garnet (GGG) substrate. The literature has reported that ferromagnetic resonance (FMR) frequencies of YIG/GGG decrease at temperatures below 50 K despite the increase in YIG magnetization. We investigated a 97 nm-thick YIG film grown on 500 $\mathrmμ$m-thick GGG substrate through a series of experiments conducted at temperatures as low as 30 mK, and using both analytical and numerical methods. Our findings suggest that the primary factor contributing to the FMR frequency shift is the stray magnetic field created by the partially magnetized GGG substrate. This stray field is antiparallel to the applied external field and is highly inhomogeneous, reaching up to 40 mT in the center of the sample. At temperatures below 500 mK, the GGG field exhibits a saturation that cannot be described by the standard Brillouin function for a paramagnet. Including the calculated GGG field in the analysis of the FMR frequency versus temperature dependence allowed the determination of the cubic and uniaxial anisotropies. We find that the total anisotropy increases more than three times with the decrease in temperature down to 2 K. Our findings enable accurate predictions of the YIG/GGG magnetic systems behavior at low and ultra-low millikelvin temperatures, crucial for developing quantum magnonic devices.

cond-mat.mes-hall↗

ScreenAgent: A Vision Language Model-driven Computer Control Agent

Existing Large Language Models (LLM) can invoke a variety of tools and APIs to complete complex tasks. The computer, as the most powerful and universal tool, could potentially be controlled directly by a trained LLM agent. Powered by the computer, we can hopefully build a more generalized agent to assist humans in various daily digital works. In this paper, we construct an environment for a Vision Language Model (VLM) agent to interact with a real computer screen. Within this environment, the agent can observe screenshots and manipulate the Graphics User Interface (GUI) by outputting mouse and keyboard actions. We also design an automated control pipeline that includes planning, acting, and reflecting phases, guiding the agent to continuously interact with the environment and complete multi-step tasks. Additionally, we construct the ScreenAgent Dataset, which collects screenshots and action sequences when completing a variety of daily computer tasks. Finally, we trained a model, ScreenAgent, which achieved computer control capabilities comparable to GPT-4V and demonstrated more precise UI positioning capabilities. Our attempts could inspire further research on building a generalist LLM agent. The code is available at \url{https://github.com/niuzaisheng/ScreenAgent}.

cs.HC↗

Optimize Individualized Energy Delivery for Septic Patients Using Predictive Deep Learning Models: A Real World Study

Background and Objectives: We aim to establish deep learning models to optimize the individualized energy delivery for septic patients. Methods and Study Design: We conducted a study of adult septic patients in Intensive Care Unit (ICU), collecting 47 indicators for 14 days. After data cleaning and preprocessing, we used stats to explore energy delivery in deceased and surviving patients. We filtered out nutrition-related features and divided the data into three metabolic phases: acute early, acute late, and rehabilitation. Models were built using data before September 2020 and validated on the rest. We then established optimal energy target models for each phase using deep learning. Results: A total of 277 patients and 3115 data were included in this study. The models indicated that the optimal energy targets in the three phases were 900kcal/d, 2300kcal/d, and 2000kcal/d, respectively. Excessive energy intake increased mortality rapidly in the early period of the acute phase. Insufficient energy in the late period of the acute phase significantly raised the mortality of septic patients. For the rehabilitation phase, too much or too little energy delivery both associated with high mortality. Conclusion: Our study established time-series prediction models for septic patients to optimize energy delivery in the ICU. This approach indicated the feasibility of developing nutritional tools for critically ill patients. We recommended permissive underfeeding only in the early acute phase. Later, increased energy intake may improve survival and settle energy debts caused by underfeeding.

q-bio.OT↗

Nonlinear erasing of propagating spin-wave pulses in thin-film Ga:YIG

Nonlinear phenomena are key for magnon-based information processing, but the nonlinear interaction between two spin-wave signals requires their spatio-temporal overlap which can be challenging for directional processing devices. Our study focuses on a gallium-substituted yttrium iron garnet film, which exhibits an exchange-dominated dispersion relation and thus provides a particularly broad range of group velocities compared to pure YIG. Using time- and space-resolved Brillouin light scattering spectroscopy, we demonstrate the excitation of time-separated spin-wave pulses at different frequencies from the same source, where the delayed pulse catches up with the previously excited pulse and outruns it due to its higher group velocity. By varying the excitation power of the faster pulse, the outcome can be finely tuned from a linear superposition to a nonlinear interaction of both pulses, resulting in a full attenuation of the slower pulse. Therefore, our findings demonstrate the all-magnonic erasing process of a propagating magnonic signal, which enables the realization of complex temporal logic operations with potential application, e.g., in inhibitory neuromorphic functionalities.

cond-mat.mtrl-sci↗

Model-Free $δ$-Policy Iteration Based on Damped Newton Method for Nonlinear Continuous-Time H$\infty$ Tracking Control

This paper presents a δ-PI algorithm which is based on damped Newton method for the H{\infty} tracking control problem of unknown continuous-time nonlinear system. A discounted performance function and an augmented system are used to get the tracking Hamilton-Jacobi-Isaac (HJI) equation. Tracking HJI equation is a nonlinear partial differential equation, traditional reinforcement learning methods for solving the tracking HJI equation are mostly based on the Newton method, which usually only satisfies local convergence and needs a good initial guess. Based upon the damped Newton iteration operator equation, a generalized tracking Bellman equation is derived firstly. The δ-PI algorithm can seek the optimal solution of the tracking HJI equation by iteratively solving the generalized tracking Bellman equation. On-policy learning and off-policy learning δ-PI reinforcement learning methods are provided, respectively. Off-policy version δ-PI algorithm is a model-free algorithm which can be performed without making use of a priori knowledge of the system dynamics. NN-based implementation scheme for the off-policy δ-PI algorithms is shown. The suitability of the model-free δ-PI algorithm is illustrated with a nonlinear system simulation.

cs.LG↗