Search

Recommender systems (RS) serve as a fundamental tool for navigating the vast expanse of online information, with deep learning advancements playing an increasingly important role in improving ranking accuracy. Among these, graph neural networks (GNNs) excel at extracting higher-order structural information, while large language models (LLMs) are designed to process and comprehend natural language, making both approaches highly effective and widely adopted. Recent research has focused on graph foundation models (GFMs), which integrate the strengths of GNNs and LLMs to model complex RS problems more efficiently by leveraging the graph-based structure of user-item relationships alongside textual understanding. In this survey, we provide a comprehensive overview of GFM-based RS technologies by introducing a clear taxonomy of current approaches, diving into methodological details, and highlighting key challenges and future directions. By synthesizing recent advancements, we aim to offer valuable insights into the evolving landscape of GFM-based recommender systems.

In this article, the vector, axial vector and tensor form factors of $B_{c}\to \chi_{cJ}$ ($J=0,1,2$) and $B_{c}\to h_{c}$ are analyzed within the framework of three-point QCD sum rules. With the calculated vector and axial vector form factors, we directly study the decay widths and branching ratios of semileptonic decays $B_{c}^{-}\to \chi_{cJ}l \bar{\nu}_l, h_{c}l \bar{\nu}_l$ $(l=e, \mu$ and $\tau)$ and analyze the nonleptonic decays $B_{c}^{-}\to \chi_{cJ}\pi^{-}, \chi_{cJ}K^{-}, \chi_{cJ}\rho^{-}, \chi_{cJ}K^{*-}$, $B_{c}^{-}\to h_{c}\pi^{-}, h_{c}K^{-}, h_{c}\rho^{-}, h_{c}K^{*-}$ by using the naive factorization approach (NFA). These results can provide more information to understand the properties of $B_{c}$ meson and $P$-wave charmonia and to study the heavy quark dynamics.

Database management system (DBMS) configuration debugging, e.g., diagnosing poorly configured DBMS knobs and generating troubleshooting recommendations, is crucial in optimizing DBMS performance. However, the configuration debugging process is tedious and, sometimes challenging, even for seasoned database administrators (DBAs) with sufficient experience in DBMS configurations and good understandings of the DBMS internals (e.g., MySQL or Oracle). To address this difficulty, we propose Andromeda, a framework that utilizes large language models (LLMs) to enable automatic DBMS configuration debugging. Andromeda serves as a natural surrogate of DBAs to answer a wide range of natural language (NL) questions on DBMS configuration issues, and to generate diagnostic suggestions to fix these issues. Nevertheless, directly prompting LLMs with these professional questions may result in overly generic and often unsatisfying answers. To this end, we propose a retrieval-augmented generation (RAG) strategy that effectively provides matched domain-specific contexts for the question from multiple sources. They come from related historical questions, troubleshooting manuals and DBMS telemetries, which significantly improve the performance of configuration debugging. To support the RAG strategy, we develop a document retrieval mechanism addressing heterogeneous documents and design an effective method for telemetry analysis. Extensive experiments on real-world DBMS configuration debugging datasets show that Andromeda significantly outperforms existing solutions.

Modern collider phenomenology requires unprecedented precision for the theoretical predictions, for which slicing techniques provide an essential tool at next-to-next-to-leading order in the strong coupling. The most popular slicing variable is based on the transverse momentum $q_T$ of a color-singlet final state, but its generalization to final states with jets is known to be very difficult. Here we propose two generalizations of $q_T$ that can be used for jet processes, providing proof of concept with an NLO slicing for $pp \to 2$ jets and presenting factorization formulae that pave the way for extending our approach to NNLO. One of these extensions only applies to planar Born processes, such as $pp \to 2$ jets, but offers a dramatic simplification of the soft function. We also discuss how our approach can directly be extended to obtain predictions for the fragmentation of hadrons. This presents a promising path for high-precision QCD calculations with multi-jet final states., Comment: 4 pages + supplemental material, 4 figures

This article is devoted to calculating the form factors of $B_c \to D^{*}$, $B_c \to D$, $B_c \to D_s^{*}$ and $B_c \to D_s$ transitions in the framework of three-point QCD sum rules. At the QCD side, the contributions of $\langle\overline{q}q\rangle$, $\langle\overline{q}g_{s}\sigma Gq\rangle$, $\langle g_{s}^{2}G^{2}\rangle$, $\langle f^{3}G^{3}\rangle$ and $\langle\overline{q}q\rangle \langle g_{s}^{2}G^{2}\rangle$ are taken into account. With the obtained form factors, the decay widths and branching ratios of several two-body nonleptonic decay processes $B_c \to \eta_c D^{*}$, $\eta_c D$, $ J/\psi D^{*}$, $ J/\psi D$, $\eta_c D_s^{*}$, $\eta_c D_s$, $J/\psi D_s^{*}$ and $J/\psi D_s$ are predicted. These results about the form factors and decay properties of $B_c$ meson provide useful information for us to study the heavy-quark dynamics.

We present our recent studies on thermal field theories using quantum algorithms. We first delve into the representation of quantum fields via qubits on general digital quantum computers alongside the quantum algorithms employed to evaluate thermal properties of generic quantum field theories. Then, we show our numerical results of thermal field theories in 1+1 dimensions using quantum simulators. Both fermion and scalar fields will be discussed. These studies aim to understand thermal fixed points for our forthcoming work on studying thermalisation in quantum field theories in real time quantum simulation., Comment: 6 pages, 3 figures; contribution to the proceedings of the 42nd International Conference on High Energy Physics (ICHEP2024), 18-24 July 2024, Prague, Czech Republic

Marmoset, a highly vocalized primate, has become a popular animal model for studying social-communicative behavior and its underlying mechanism comparing with human infant linguistic developments. In the study of vocal communication, it is vital to know the caller identities, call contents, and vocal exchanges. Previous work of a CNN has achieved a joint model for call segmentation, classification, and caller identification for marmoset vocalizations. However, the CNN has limitations in modeling long-range acoustic patterns; the Transformer architecture that has been shown to outperform CNNs, utilizes the self-attention mechanism that efficiently segregates information parallelly over long distances and captures the global structure of marmoset vocalization. We propose using the Transformer to jointly segment and classify the marmoset calls and identify the callers for each vocalization.

Achieving high-resolution, identity consistency, and accurate lip-speech synchronization in face visual dubbing presents significant challenges, particularly for real-time applications like live video streaming. We propose MuseTalk, which generates lip-sync targets in a latent space encoded by a Variational Autoencoder, enabling high-fidelity talking face video generation with efficient inference. Specifically, we project the occluded lower half of the face image and itself as an reference into a low-dimensional latent space and use a multi-scale U-Net to fuse audio and visual features at various levels. We further propose a novel sampling strategy during training, which selects reference images with head poses closely matching the target, allowing the model to focus on precise lip movement by filtering out redundant information. Additionally, we analyze the mechanism of lip-sync loss and reveal its relationship with input information volume. Extensive experiments show that MuseTalk consistently outperforms recent state-of-the-art methods in visual fidelity and achieves comparable lip-sync accuracy. As MuseTalk supports the online generation of face at 256x256 at more than 30 FPS with negligible starting latency, it paves the way for real-time applications., Comment: 15 pages, 4 figures

In this paper, we introduce a novel nonstationary price staleness factor model allowing for market friction pervasive across assets and possible input covariates. With large panel high-frequency data, we give the maximum likelihood estimators of the regressing coefficients, and the factors and their loading parameters, which recovers the time-varying price stale probability and an integrated functional of the price staleness over two assets. The asymptotic results are obtained when both the dimension $d$ and the sampling frequency $n$ diverge simultaneously. With the local principal component analysis (LPCA) method, we find that the efficient price co-volatilities (systematic and idiosyncratic), are biased downward due to the presence of staleness. Bias corrected estimators of the systematic and idiosyncratic covolatities (spot and integrated) are provided and proved to be consistent. Interestingly, beside their dependence on the dimensionality $d$, the integrated estimates converge with a factor of $n^{-1/2}$ though the local PCA estimates converge with a factor of $n^{-1/4}$, validating the aggregation efficiency after nonlinear nonstationary factor analysis. But the bias correction degrade the convergence rates of the estimated (spot or integrated) systematic covolatilies. Numerical experiments justify our theoretical findings. Empirically, we observe that the staleness correction indeed leads to higher in-sample systematic volatility estimates, but a reduced out-of-sample portfolio risk almost uniformly in tested gross exposure levels.

Large language models (LLMs) have a transformative impact on a variety of scientific tasks across disciplines including biology, chemistry, medicine, and physics. However, ensuring the safety alignment of these models in scientific research remains an underexplored area, with existing benchmarks primarily focusing on textual content and overlooking key scientific representations such as molecular, protein, and genomic languages. Moreover, the safety mechanisms of LLMs in scientific tasks are insufficiently studied. To address these limitations, we introduce SciSafeEval, a comprehensive benchmark designed to evaluate the safety alignment of LLMs across a range of scientific tasks. SciSafeEval spans multiple scientific languages-including textual, molecular, protein, and genomic-and covers a wide range of scientific domains. We evaluate LLMs in zero-shot, few-shot and chain-of-thought settings, and introduce a "jailbreak" enhancement feature that challenges LLMs equipped with safety guardrails, rigorously testing their defenses against malicious intention. Our benchmark surpasses existing safety datasets in both scale and scope, providing a robust platform for assessing the safety and performance of LLMs in scientific contexts. This work aims to facilitate the responsible development and deployment of LLMs, promoting alignment with safety and ethical standards in scientific research.

Understanding propagation mechanisms in complex networks is essential for fields like epidemiology and multi-robot networks. This paper reviews various propagation models, from traditional deterministic frameworks to advanced data-driven and deep learning approaches. We differentiate between static and dynamic networks, noting that static models provide foundational insights, while dynamic models capture real-world temporal changes. Deterministic models like the SIR framework offer clear mathematical insights but often lack adaptability to randomness, whereas stochastic models enhance realism at the cost of interpretability. Behavior-based models focus on individual decision-making, demanding more computational resources. Data-driven approaches improve accuracy in nonlinear scenarios by adapting to evolving networks, using either traditional models or model-free machine learning techniques. We explore supervised and unsupervised learning methods, as well as reinforcement learning, which operates without predefined datasets. The application of graph neural networks (GNNs) is also discussed, highlighting their effectiveness in modeling propagation in complex networks. The paper underscores key applications and challenges associated with each model type, emphasizing the increasing importance of hybrid and machine learning-based solutions in contemporary network propagation issues., Comment: Network Propagation, Machine Learning, De- terministic Model, Model-based Approaches, Model-free Ap- proaches

Inspired by the great progress in the observations of charmonium-like states in recent years, we perform a systematic analysis about the ground states and the first radially excited states of $qc\bar{q}\bar{c}$ ($q$=$u/d$ and $s$) tetraquark systems. Their mass spectra, root mean square (r.m.s.) radii and radial density distributions are predicted within the framework of relativized quark model. By comparing with experimental data, some potential candidates for hidden-charm tetraquark states are suggested. For $qc\bar{q}\bar{c}$ ($q$=$u/d$) system, if $Z_{c}(3900)$ is supposed to be a compact tetraquark state with $J^{PC}=1^{+-}$, $Z(4430)$ can be interpreted as the first radially excited states of $Z_{c}(3900)$. Another broad structure $Z_{c}(4200)$ can also be explained as a partner of $Z_{c}(3900)$, and it arise from a higher state with $J^{PC}=1^{+-}$. In addition, theoretical predictions indicate that the possible assignments for $X(3930)$, $X(4050)$ and $X(4250)$ are low lying $0^{++}$ tetraquark states. As for the $sc\bar{s}\bar{c}$ system, $X(4140)$ and $X(4274)$ structures can be interpreted as this type of tetraquark states with $J^{PC}=1^{++}$, and $X(4350)$ can be described as a $sc\bar{s}\bar{c}$ tetraquark with $J^{PC}=0^{++}$. With regard to $qc\bar{s}\bar{c}$ ($q$=$u/d$) system, we find two potential candidates for this type of tetraquark, which are $Z_{cs}(4000)$ and $Z_{cs}(4220)$ structures. The measured masses of these two structures are in agreement with theoretical predictions for the $1^{+}$ state.

The superiority of Multi-Robot Systems (MRS) in various complex environments is unquestionable. However, in complex situations such as search and rescue, environmental monitoring, and automated production, robots are often required to work collaboratively without a central control unit. This necessitates an efficient and robust decentralized control mechanism to process local information and guide the robots' behavior. In this work, we propose a new decentralized controller design method that utilizes the Deep Q-Network (DQN) algorithm from deep reinforcement learning, aimed at improving the integration of local information and robustness of multi-robot systems. The designed controller allows each robot to make decisions independently based on its local observations while enhancing the overall system's collaborative efficiency and adaptability to dynamic environments through a shared learning mechanism. Through testing in simulated environments, we have demonstrated the effectiveness of this controller in improving task execution efficiency, strengthening system fault tolerance, and enhancing adaptability to the environment. Furthermore, we explored the impact of DQN parameter tuning on system performance, providing insights for further optimization of the controller design. Our research not only showcases the potential application of the DQN algorithm in the decentralized control of multi-robot systems but also offers a new perspective on how to enhance the overall performance and robustness of the system through the integration of local information., Comment: Multi-robot system, Reinforcement learning, Information ingrated

With the continuous breakthroughs in core technology, the dawn of large-scale integration of robotic systems into daily human life is on the horizon. Multi-robot systems (MRS) built on this foundation are undergoing drastic evolution. The fusion of artificial intelligence technology with robot hardware is seeing broad application possibilities for MRS. This article surveys the state-of-the-art of robot learning in the context of Multi-Robot Cooperation (MRC) of recent. Commonly adopted robot learning methods (or frameworks) that are inspired by humans and animals are reviewed and their advantages and disadvantages are discussed along with the associated technical challenges. The potential trends of robot learning and MRS integration exploiting the merging of these methods with real-world applications is also discussed at length. Specifically statistical methods are used to quantitatively corroborate the ideas elaborated in the article., Comment: Multi-robot, Cooperation, robot learning

In this study, we obtain specific picture of the phase transitions for the 6-dimensional Gauss-Bonnet Anti-de Sitter (AdS) black hole with triple phases, using the generalized free energy we constructed and Kramers escape rate in stochastic motion. There are six possible phase transition processes between the three different stable states (small, medium, and large black hole states). During these phase transitions, there are two key temperatures. One is the temperature at which the medium black hole state emerges, and the other is the temperature at which the small black hole state annihilates. Meanwhile, two dynamic equilibrium processes are formed. One is a dynamic equilibrium of the transition from the medium black hole state to the large black hole state and the transition from the small black hole state to the medium black hole state. The other is a dynamic equilibrium of the transition from the small black hole state to the medium black hole state and the transition from the medium black hole state to the small black hole state., Comment: v1: 10 pages, 4 figures; v2: 11 pages, 6 figures, published in Physics Letters B

The assumption of factorization lies at the core of calculations of medium effects on observables computable in perturbative Quantum Chromodynamics. In this work we examine this assumption, for which we propose a setup to study hard processes and bulk nuclear matter in heavy-ion collisions on the same footing using the Glauber modelling of heavy nuclei. To exemplify this approach, we calculate the leading-order corrections to azimuthal decorrelation in Drell-Yan and boson-jet processes due to cold nuclear matter effects, not considering radiation. At leading order in both the hard momentum scale and the nuclear size, the impact-parameter dependent cross section is found to factorize for both processes. The factorization formula involves a convolution of the hard cross section with the medium-modified parton distributions, and, for boson-jet production, the medium-modified jet function., Comment: 37pages, 6figures, V2 submission to JHEP

A novel thermodynamic phenomenon has been observed in the quantum Ba\~{n}ados-Teitelboim-Zanelli (qBTZ) black hole, utilizing generalized free energy and Kramer escape rate. This phenomenon also reveals the unique property of the quantum black hole. The stochastic thermal motion of various thermodynamic states within the black hole system induces phase transitions, under the influence of generalized free energy which obtained by extending Maxwell's construction. Through the analysis of Kramer escape rate, it is discovered that the qBTZ black hole thermodynamic system exhibits a bounce effect. It originates from the non-monotonicity of entropy in black hole thermodynamic systems. Furthermore, the overall thermodynamic picture of the qBTZ black hole has been obtained under different quantum backreactions., Comment: v1:8 pages, 3 figures; v2: JHEP accepted

Recently, researchers have investigated the capabilities of Large Language Models (LLMs) for generative recommender systems. Existing LLM-based recommender models are trained by adding user and item IDs to a discrete prompt template. However, the disconnect between IDs and natural language makes it difficult for the LLM to learn the relationship between users. To address this issue, we propose a PErsonAlized PrOmpt Distillation (PeaPOD) approach, to distill user preferences as personalized soft prompts. Considering the complexities of user preferences in the real world, we maintain a shared set of learnable prompts that are dynamically weighted based on the user's interests to construct the user-personalized prompt in a compositional manner. Experimental results on three real-world datasets demonstrate the effectiveness of our PeaPOD model on sequential recommendation, top-n recommendation, and explanation generation tasks.

Augmenting Large Language Models (LLMs) with retrieved external knowledge has proven effective for improving the factual accuracy of generated responses. Despite their success, retrieval-augmented LLMs still face the distractibility issue, where the generated responses are negatively influenced by noise from both external and internal knowledge sources. In this paper, we introduce a novel, training-free decoding method guided by entropy considerations to mitigate this issue. Our approach utilizes entropy-based document-parallel ensemble decoding to prioritize low-entropy distributions from retrieved documents, thereby enhancing the extraction of relevant information of context. Additionally, it incorporates a contrastive decoding mechanism that contrasts the obtained low-entropy ensemble distribution with the high-entropy distribution derived from the model's internal knowledge across layers, which ensures a greater emphasis on reliable external information. Extensive experiments on open-domain question answering datasets demonstrate the superiority of our method.

Utilizing user profiles to personalize Large Language Models (LLMs) has been shown to enhance the performance on a wide range of tasks. However, the precise role of user profiles and their effect mechanism on LLMs remains unclear. This study first confirms that the effectiveness of user profiles is primarily due to personalization information rather than semantic information. Furthermore, we investigate how user profiles affect the personalization of LLMs. Within the user profile, we reveal that it is the historical personalized response produced or approved by users that plays a pivotal role in personalizing LLMs. This discovery unlocks the potential of LLMs to incorporate a greater number of user profiles within the constraints of limited input length. As for the position of user profiles, we observe that user profiles integrated into different positions of the input context do not contribute equally to personalization. Instead, where the user profile that is closer to the beginning affects more on the personalization of LLMs. Our findings reveal the role of user profiles for the personalization of LLMs, and showcase how incorporating user profiles impacts performance providing insight to leverage user profiles effectively.

Deep learning models are well known to be susceptible to backdoor attack, where the attacker only needs to provide a tampered dataset on which the triggers are injected. Models trained on the dataset will passively implant the backdoor, and triggers on the input can mislead the models during testing. Our study shows that the model shows different learning behaviors in clean and poisoned subsets during training. Based on this observation, we propose a general training pipeline to defend against backdoor attacks actively. Benign models can be trained from the unreliable dataset by decoupling the learning process into three stages, i.e., supervised learning, active unlearning, and active semi-supervised fine-tuning. The effectiveness of our approach has been shown in numerous experiments across various backdoor attacks and datasets.

Recently, deep neural networks have been shown to be vulnerable to backdoor attacks. A backdoor is inserted into neural networks via this attack paradigm, thus compromising the integrity of the network. As soon as an attacker presents a trigger during the testing phase, the backdoor in the model is activated, allowing the network to make specific wrong predictions. It is extremely important to defend against backdoor attacks since they are very stealthy and dangerous. In this paper, we propose a novel defense mechanism, Neural Behavioral Alignment (NBA), for backdoor removal. NBA optimizes the distillation process in terms of knowledge form and distillation samples to improve defense performance according to the characteristics of backdoor defense. NBA builds high-level representations of neural behavior within networks in order to facilitate the transfer of knowledge. Additionally, NBA crafts pseudo samples to induce student models exhibit backdoor neural behavior. By aligning the backdoor neural behavior from the student network with the benign neural behavior from the teacher network, NBA enables the proactive removal of backdoors. Extensive experiments show that NBA can effectively defend against six different backdoor attacks and outperform five state-of-the-art defenses.

The form factors of $B_c\rightarrow\eta_c$ and $B_c\rightarrow J/\psi$ are analyzed in the framework of three-point QCD sum rules. In these analyses, the contributions of the vacuum condensate terms $\langle g_{s}^{2}GG\rangle$ and $\langle g_{s}^{3}GGGf\rangle$ are considered. In addition, the decay widths and branching ratios of several decay channels are obtained by using the calculated form factors. These decay processes include the nonleptonic decays of $B_c^- \to \eta_c \pi^-$, $\eta_c K^-$, $\eta_c \rho^-$, $\eta_c K^{*-}$, $B_c^- \to J/\psi \pi^-$, $J/\psi K^-$, $J/\psi \rho^-$, $J/\psi K^{*-}$, and the semileptonic decays of $B_c^- \to \eta_c \mathcal{l} \bar{\nu}$, $B_c^- \to J/\psi \mathcal{l} \bar{\nu}$. These results about the form factors and decay properties of $B_c$ meson provide useful information for us to study the heavy-quark dynamics and find new physics(NP) beyond Standard Model(SM).

Instruction tuning plays a crucial role in shaping the outputs of language models (LMs) to desired styles. In this work, we propose a simple yet effective method, Instruction Modelling (IM), which trains LMs by applying a loss function to the instruction and prompt part rather than solely to the output part. Through experiments across 21 diverse benchmarks, we show that, in many scenarios, IM can effectively improve the LM performance on both NLP tasks (e.g., MMLU, TruthfulQA, and HumanEval) and open-ended generation benchmarks (e.g., MT-Bench and AlpacaEval). Remarkably, in the most advantageous case, IM boosts model performance on AlpacaEval 1.0 by over 100%. We identify two key factors influencing the effectiveness of IM: (1) The ratio between instruction length and output length in the training data; and (2) The number of training examples. We observe that IM is especially beneficial when trained on datasets with lengthy instructions paired with brief outputs, or under the Superficial Alignment Hypothesis (SAH) where a small amount of training examples are used for instruction tuning. Further analysis substantiates our hypothesis that our improvement can be attributed to reduced overfitting to instruction tuning datasets. It is worth noting that we are not proposing \ours as a replacement for current fine-tuning processes. Instead, our work aims to provide practical guidance for instruction tuning LMs, especially in low-resource scenarios., Comment: NeurIPS 2024. Code is available at https://github.com/ZhengxiangShi/InstructionModelling

Uni-directional social interactions are ubiquitous in real social networks whereas undirected interactions are intensively studied. We establish a voter model in a dynamical directed network. We analytically obtain the degree distribution of the evolving network at any given time. Furthermore, we find that the average degree is captured by an emergent game. On the other hand, we find that the fate of opinions is captured by another emergent game. Beyond expectation, the two emergent games are typically different due to the unidirectionality of the evolving networks. The Nash equilibrium analysis of the two games facilitates us to give the criterion under which the minority opinion with few disciples initially takes over the population eventually for in-group bias. Our work fosters the understanding of opinion dynamics ranging from methodology to research content., Comment: arXiv admin note: substantial text overlap with arXiv:2307.05511

Ground-based laser interferometric gravitational wave detectors consist of complex multiple optical cavity systems. An arm-length stabilization (ALS) system has played an important role in bringing such complex detector into operational state and enhance the duty cycle. The sensitivity of these detectors can be improved if the thermal noise of their test mass mirror coatings is reduced. Crystalline AlGaAs coatings are a promising candidate for this. However, traditional ALS system with frequency-doubled 532 nm light is no longer an option with AlGaAs coatings due to the narrow bandgap of GaAs, thus alternative locking schemes must be developed. In this letter, we describe an experimental demonstration of a novel ALS scheme which is compatible with AlGaAs coatings. This ALS scheme will enable the use of AlGaAs coatings and contribute to improved sensitivity of future detectors.

Thermal properties of quantum fields at finite temperature are crucial to understanding strongly interacting matter and recent development in quantum computing has provided an alternative and promising avenue of study. In this work, we study thermal field theories involving only fermions using quantum algorithms. We first delve into the presentations of fermion fields via qubits on digital quantum computers alongside the quantum algorithms such as quantum imaginary time evolutions employed to evaluate thermal properties of generic quantum field theories. Specifically, we show numerical results such as the thermal distribution and the energy density of thermal field theories for Majorana fermions in 1+1 dimensions using quantum simulators. In addition to free field theory, we also study the effects of interactions resulting from coupling with a spatially homogeneous Majorana field. In both cases, we show analytically that thermal properties of the system can be described using phase-space distributions, and the quantum simulation results agree with analytical and semiclassical expectations. Our work is an important step to understand thermal fixed points, preparing for quantum simulation of thermalization in real time., Comment: 30 pages, 6 figures

In this paper, we study discrete Carleman estimates for space semi-discrete approximations of one-dimensional stochastic parabolic equation. As applications of these discrete Carleman estimates, we apply them to study two inverse problems for the spatial semi-discrete stochastic parabolic equations, including a discrete inverse random source problem and a discrete Cauchy problem. We firstly establish two Carleman estimates for a one-dimensional semi-discrete stochastic parabolic equation, one for homogeneous boundary and the other for non-homogeneous boundary. Then we apply these two estimates separately to derive two stability results. The first one is the Lipschitz stability for the discrete inverse random source problem. The second one is the H\"{o}lder stability for the discrete Cauchy problem.