Efficient modeling and simulation of uncertainties in computational fluid dynamics (CFD) remains a crucial challenge. In this paper, we present the first stochastic Galerkin (SG) lattice Boltzmann method (LBM) built u...
详细信息
Explicit Runge–Kutta (RK) methods are susceptible to a reduction in the observed order of convergence when applied to initial-boundary value problem with time-dependent boundary conditions. We study conditions on exp...
详细信息
Group recommendation involves comprehensively considering various aspects, including members and items, to predict the overall interests of a group and recommend suitable items through a recommendation system. With th...
Group recommendation involves comprehensively considering various aspects, including members and items, to predict the overall interests of a group and recommend suitable items through a recommendation system. With the rapid evolution of the Internet, online group activities have become increasingly prevalent, making group recommendation a highly discussed topic within the realm of recommendation systems. However, current research in group recommendation still confronts the following challenges. Firstly, a predominant portion of group recommendation research focuses solely on aggregating group-level information, neglecting the valuable contribution of higher-order member-level insights to group recommendation. Moreover, some aggregation strategies overly prioritize fairness, thereby disregarding common real-world patterns. Secondly, previous studies have primarily relied on aggregating individual member interests to establish group preferences, lacking a holistic consideration of group dynamics. To tackle these challenges, this study introduces an innovative approach by implementing multi-channel hypergraph convolution within the member perspective. This approach aims to effectively extract higher-order insights from members by utilizing a member information enhancement module. By establishing group interconnections based on similarity and employing an adaptive fusion network to amalgamate multiple viewpoints, a final representation is derived. Experimental results demonstrate that our proposed model surpasses baseline models by 3% to 4% in terms of hit rate and accuracy, validating the efficacy of our approach.
this paper,we propose a class of smoothing-regularization methods for solving the mathematical programming with vanishing *** methods include the smoothing-regularization method proposed by Kanzow et ***[***.,2013,55(...
详细信息
this paper,we propose a class of smoothing-regularization methods for solving the mathematical programming with vanishing *** methods include the smoothing-regularization method proposed by Kanzow et ***[***.,2013,55(3):733-767]as a special *** the weaker conditions than the ones that have been used by Kanzow et *** 2013,we prove that the Mangasarian-Fromovitz constraint qualification holds at the feasible points of smoothing-regularization *** also analyze that the convergence behavior of the proposed smoothing-regularization method under mild conditions,i.e.,any accumulation point of the stationary point sequence for the smoothing-regularization problem is a strong stationary ***,numerical experiments are given to show the efficiency of the proposed methods.
Diffusion models have indeed shown great promise in solving inverse problems in image processing. In this paper, we propose a novel, problem-agnostic diffusion model called the maximum a posteriori (MAP)-based guided ...
详细信息
This study develops a calibrated beam-based algorithm with awareness of the global attention distribution for neural abstractive summarization, aiming to improve the local optimality problem of the original beam searc...
ISBN:
(纸本)9781713845393
This study develops a calibrated beam-based algorithm with awareness of the global attention distribution for neural abstractive summarization, aiming to improve the local optimality problem of the original beam search in a rigorous way. Specifically, a novel global protocol is proposed based on the attention distribution to stipulate how a global optimal hypothesis should attend to the source. A global scoring mechanism is then developed to regulate beam search to generate summaries in a near-global optimal fashion. This novel design enjoys a distinctive property, i.e., the global attention distribution could be predicted before inference, enabling step-wise improvements on the beam search through the global scoring mechanism. Extensive experiments on nine datasets show that the global (attention)-aware inference significantly improves state-of-the-art summarization models even using empirical hyper-parameters. The algorithm is also proven robust as it remains to generate meaningful texts with corrupted attention distributions. The codes and a comprehensive set of examples are available.
In this paper, we study the homogenization of the distribution-dependent stochastic abstract fluid models by combining the two−scale convergence and martingale representative approach. A general framework of the homog...
详细信息
The Learning-With-Errors (LWE) problem is a crucial computational challenge with significant implications for post-quantum cryptography and computational learning theory. Here we propose a quantum-classical hybrid alg...
详细信息
Harmonics are a ubiquitous feature across various pulsating stars. They are traditionally viewed as mere replicas of the independent primary pulsation modes and have thus been excluded from asteroseismological models....
详细信息
We present and analyze the quantum entanglement generated from two-photon joint subtraction from two-mode squeezed vacuum states (TMSV). Larger entanglement negativity than single-photon jointly subtracted TMSV, photo...
详细信息
ISBN:
(数字)9798350308396
ISBN:
(纸本)9798350308402
We present and analyze the quantum entanglement generated from two-photon joint subtraction from two-mode squeezed vacuum states (TMSV). Larger entanglement negativity than single-photon jointly subtracted TMSV, photon-subtracted TMSV and TMSV is obtained when the squeezing parameter, ξ ≤ 0.58.
暂无评论