作者：
白中治State Key Laboratory of Scientific
Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Chinese Academy of Sciences Beijing P R China
This paper proposes a class of parallel interval matrix multisplitting AOR methods far solving systems of interval linear equations and discusses their convergence properties under the conditions that the coefficient ...
详细信息
This paper proposes a class of parallel interval matrix multisplitting AOR methods far solving systems of interval linear equations and discusses their convergence properties under the conditions that the coefficient matrices are interval H-matrices.
The global boundness and existence are presented for the kind of the Rosseland equation with a general growth condition. A linearized map in a closed convex set is defined. The image set is precompact, and thus a fixe...
详细信息
The global boundness and existence are presented for the kind of the Rosseland equation with a general growth condition. A linearized map in a closed convex set is defined. The image set is precompact, and thus a fixed point exists. A multi-scale expansion method is used to obtain the homogenized equation. This equation satisfies a similar growth condition.
Dear Editor, This letter presents a finite-time online parameter self-learning disturbance rejection surge speed control method for a marine surface vehicle (MSV). Specifically, a finite-time parameter self-learning r...
详细信息
Fused silica (SiO2) glass is integral to numerous industries owing to its exceptional physical and chemical attributes. Although the hydrolysis of silicon tetrachloride (SiCl4) provides a cost-effective and straightfo...
详细信息
Differential-linear cryptanalysis has attracted much attention since proposed to attack DES in 1994, and then some generalized theories are developed to complement and unify the ***, the links between differential-lin...
详细信息
Differential-linear cryptanalysis has attracted much attention since proposed to attack DES in 1994, and then some generalized theories are developed to complement and unify the ***, the links between differential-linear cryptanalysis and other important cryptanalysis methods have been still *** motivation is to fix the *** establishing some boolean equations, we propose the mathematical links among differential, linear and differential-linear *** then generalise the definition of capacity and present some properties of the capacity of differential *** links and properties are employed to explore the relationships between multidimensional differential-linear hulls and integral *** show that a multidimensional differential-linear hull of certain correlation always implies the existence of an integral distinguisher and a zero-correlation linear hull, while a special integral distinguisher indicates the existence of a multidimensional differential-linear hull.
Compared to supervised learning methods, self-supervised learning methods address the domain gap problem between light field (LF) datasets collected under varying acquisition conditions, which typically leads to decre...
详细信息
The convergence properties of the Fletcher-Reeves method for unconstrained optimization are further studied with the technique of generalized line search. Two conditions are given which guarantee the global convergenc...
详细信息
The convergence properties of the Fletcher-Reeves method for unconstrained optimization are further studied with the technique of generalized line search. Two conditions are given which guarantee the global convergence of the Fletcher-Reeves method using generalized Wolfe line searches or generalized Arjimo line searches, whereas an example is constructed showing that the conditions cannot be relaxed in certain senses.
This paper presents a novel joint optical performance monitoring (OPM) scheme for multiple spatial modes in mode division multiplexing elastic optical network (MDM-EON) systems, which integrates the optimal Radon tran...
详细信息
Hamilton-Jacobiequation appears frequently in applications, e.g., in differential games and control theory, and is closely related to hyperbolic conservation laws[3, 4, 12]. This is helpful in the design of difference...
详细信息
Hamilton-Jacobiequation appears frequently in applications, e.g., in differential games and control theory, and is closely related to hyperbolic conservation laws[3, 4, 12]. This is helpful in the design of difference approximations for Hamilton-Jacobi equation and hyperbolic conservation laws. In this paper we present the relaxing system for HamiltonJacobiequations in arbitrary space dimensions, and high resolution relaxing schemes for Hamilton-Jacobi equation, based on using the local relaxation approximation. The schemes are numerically tested on a variety of 1D and 2D problems, including a problem related to optimal control problem. High-order accuracy in smooth regions, good resolution of discontinuities, and convergence to viscosity solutions are observed.
Code search is a crucial task in software engineering, aiming to retrieve code snippets that are semantically relevant to a natural language query. Recently, Pre-trained Language Models (PLMs) have shown remarkable su...
详细信息
Code search is a crucial task in software engineering, aiming to retrieve code snippets that are semantically relevant to a natural language query. Recently, Pre-trained Language Models (PLMs) have shown remarkable success and are widely adopted for code search tasks. However, PLM-based methods often struggle in cross-domain scenarios. When applied to a new domain, they typically require extensive fine-tuning with substantial data. Even worse, the data scarcity problem in new domains often forces these methods to operate in a zero-shot setting, resulting in a significant decline in performance. RAPID, which generates synthetic data for model fine-tuning, is currently the only effective method for zero-shot cross-domain code search. Despite its effectiveness, RAPID demands substantial computational resources for fine-tuning and needs to maintain specialized models for each domain, underscoring the need for a zero-shot, fine-tuning-free approach for cross-domain code search. The key to tackling zero-shot cross-domain code search lies in bridging the gaps among domains. In this work, we propose to break the query-code matching process of code search into two simpler tasks: query-comment matching and code-code matching. We first conduct an empirical study to investigate the effectiveness of these two matching schemas in zero-shot cross-domain code search. Our findings highlight the strong complementarity among the three matching schemas, i.e., query-code, query-comment, and code-code matching. Based on the findings, we propose CodeBridge, a zero-shot, fine-tuning-free approach for cross-domain code search. Specifically, CodeBridge first employs zero-shot prompting to guide Large Language Models (LLMs) to generate a comment for each code snippet in the codebase and produce a code for each query. Subsequently, it encodes queries, code snippets, comments, and the generated code using PLMs and assesses similarities through three matching schemas: query-code, query-comment,
暂无评论