检索结果-内蒙古大学图书馆

arXiv 2025年

作者： Li, Yan Wang, Zhulin Liu, Jing Guo, Lei Fournier-Viger, Philippe Wu, Youxi Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300401 China School of Artificial Intelligence Hebei University of Technology Tianjin300401 China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology Tianjin300401 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518061 China Hebei Key Laboratory of Big Data Computing 300401 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this paper explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate patterns, we propose a pattern join strategy with negative patterns which can generate both positive and negative candidate patterns at the same time. To calculate the support (frequency of occurrence) of a pattern in each sequence, we explore a NegPair algorithm that employs a key-value pair array structure to deal with the gap constraints and the negative items simultaneously and can avoid redundant rescanning of the original sequence, thus improving the efficiency of the algorithm. To report the performance of NSPG-Miner, 11 competitive algorithms and 11 datasets are employed. The experimental results not only validate the effectiveness of the strategies adopted by NSPG-Miner, but also verify that NSPG-Miner can discover more valuable information than the state-ofthe-art algorithms. Algorithms and datasets can be downloaded from https://***/wuc567/PatternMining/tree/master/NSPG-Miner. Copyright © 2025, The Authors. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

Two-scale sparse finite element approximations

引用

Science China Mathematics 2016年第4期59卷 789-808页

作者： LIU Fang ZHU JinWei School of Statistics and Mathematics Central University of Finance and Economics The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and ScientificEngineering ComputingAcademy of Mathematics and Systems ScienceChinese Academy of Sciences

To reduce computational cost,we study some two-scale finite element approximations on sparse grids for elliptic partial differential equations of second order in a general *** any tensor product domain ?R^d with d = 2,3,we construct the two-scale finite element approximations for both boundary value and eigenvalue problems by using a Boolean sum of some existing finite element approximations on a coarse grid and some univariate fine grids and hence they are cheaper *** applications,we obtain some new efficient finite element discretizations for the two classes of problem:The new two-scale finite element approximation on a sparse grid not only has the less degrees of freedom but also achieves a good accuracy of approximation.

关键词： combination discretization eigenvalue finite element postprocessing two-scale

来源：评论

学校读者我要写书评

暂无评论

The monotone convergence of a class of parallel nonlinear relaxation methods for nonlinear complementarity problems

引用

COMPUTERS & MATHEMATICS WITH APPLICATIONS 1996年第12期31卷 17-33页

作者： Bai, ZZ State Key Laboratory of Scientific/Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Chinese Academy of Sciences P.O. Box 2719 Beijing 100080 P.R. China

We set up a class of parallel nonlinear multisplitting AOR methods by directly multisplitting the nonlinear mapping involved in the nonlinear complementarity problems. The different choices of the relaxation parameters can yield all the known and a lot of new relaxation methods, as well as a lot of new relaxed parallel nonlinear multisplitting methods for solving the nonlinear complementarity problems. The two-sided approximation properties and the influences on the convergence rates from the relaxation parameters about our new methods are shown, and sufficient conditions guaranteeing the methods to converge globally are discussed. Finally, a lot of numerical results show that our new methods are feasible and efficient.

关键词： nonlinear complementarity problem nonlinear multisplitting monotonicity global convergence

来源：评论

学校读者我要写书评

暂无评论

Frustration Elimination and Excited state Search in Coherent Ising Machines

引用

Physical Review Letters 2025年第9期134卷 090401-090401页

作者： Zheng-Yang Zhou Clemens Gneiting J. Q. You Franco Nori Zhejiang Key Laboratory of Quantum State Control and Optical Field Manipulation Department of Physics Zhejiang Sci-Tech University 310018 Hangzhou China Theoretical Quantum Physics Laboratory Cluster for Pioneering Research RIKEN Wakoshi Saitama 351-0198 Japan Center for Quantum Computing RIKEN Wakoshi Saitama 351-0198 Japan Zhejiang Key Laboratory of Micro-Nano Quantum Chips and Quantum Control School of Physics and State Key Laboratory for Extreme Photonics and Instrumentation Zhejiang University Hangzhou 310027 China College of Optical Science and Engineering Zhejiang University Hangzhou 310027 China Physics Department The University of Michigan Ann Arbor Michigan 48109-1040 USA

Frustration, that is, the impossibility of satisfying the energetic preferences between all spin pairs simultaneously, underlies the complexity of many fundamental properties in spin systems, including the computational difficulty in determining their ground states. Coherent Ising machines (CIMs) have been proposed as a promising analog computational approach to efficiently find different degenerate ground states of large and complex Ising models. However, CIMs also face challenges in solving frustrated Ising models: frustration not only reduces the probability of finding good solutions, but it also prohibits the leveraging of quantum effects in doing so. To circumvent these detrimental effects of frustration, we show how frustrated Ising models can be mapped to frustration-free CIM configurations by including ancillary modes and modifying the coupling protocol used in current CIM designs. Such frustration elimination may empower current CIMs to benefit from quantum effects in dealing with frustrated Ising models. In addition, these ancillary modes can also enable error detection and searching for excited states.

关键词： Ising model

来源：评论

学校读者我要写书评

暂无评论

A Derivative-Free Optimization Algorithm Combining Line-Search and Trust-Region Techniques

引用

Chinese Annals of Mathematics,Series B 2023年第5期44卷 719-734页

作者： Pengcheng XIE Ya-xiang YUAN State Key Laboratory of Scientific/Engineering Computing Institute of Computational Mathematicsand Scientific/Engineering ComputingAcademy of Mathematics and Systems ScienceChinese Academy of SciencesUniversity of Chinese Academy of SciencesBeijing 100190China

The speeding-up and slowing-down(SUSD)direction is a novel direction,which is proved to converge to the gradient descent direction under some *** authors propose the derivative-free optimization algorithm SUSD-TR,which combines the SUSD direction based on the covariance matrix of interpolation points and the solution of the trust-region subproblem of the interpolation model function at the current iteration *** analyze the optimization dynamics and convergence of the algorithm *** of the trial step and structure step are *** results show their algorithm’s efficiency,and the comparison indicates that SUSD-TR greatly improves the method’s performance based on the method that only goes along the SUSD *** algorithm is competitive with state-of-the-art mathematical derivative-free optimization algorithms.

关键词： Nonlinear optimization Derivative-Free Quadratic model Line-Search Trust-Region

来源：评论

学校读者我要写书评

暂无评论

Low-power technologies in high-performance computer: trends and perspectives

引用

National Science Review 2016年第1期3卷 23-25页

作者： Xianghui Xie State Key Laboratory of Mathematical Engineering and Advanced Computing

INTRODUCTION With the breakdown of Dennard’s scaling rule,chip power for a given area size is not constant as transistors shrink from generation to generation[1].In particular,the power wall problem worsens with the ... 详细信息

关键词： HPC high trends and perspectives Low-power technologies in high-performance computer GPU CPU

来源：评论

学校读者我要写书评

暂无评论

Huge Stress-induced Adiabatic Temperature Change in a High-Toughness All-d-metal Heusler Alloy

arXiv

引用

arXiv 2025年

作者： Cai, Rui Wei, Zhiyang Ren, Hongjie Qian, Hanyang Zhang, Xinyu Liu, Yao Lu, Xiang Sun, Wen Gao, Meng Liu, Enke Liu, Jian Li, Guowei Dongguan Key Laboratory of Interdisciplinary Science for Advanced Materials and Large-Scale Scientific Facilities School of Physical Sciences Great Bay University Dongguan523000 China CAS Key Laboratory of Magnetic Materials and Devices Ningbo Institute of Materials Technology and Engineering Chinese Academy of Sciences Ningbo315201 China Great Bay Institute for Advanced Study Dongguan523000 China University of Chinese Academy of Sciences Beijing100049 China School of Materials Science and Engineering Shanghai University Shanghai200444 China State Key Laboratory for Mechanical Behavior of Materials Frontier Institute of Science and Technology Xi’an Jiaotong University Xi’an710049 China State Key Laboratory for Magnetism Beijing National Laboratory for Condensed Matter Physics Institute of Physics Chinese Academy of Sciences Beijing100190 China

The elastocaloric effect (eCE), referring to the thermal effect triggered by a uniaxial stress, provides a promising and versatile routine for green and high efficient thermal management. However, current eCE materials generally suffer from relatively low eCE and poor mechanical properties, hindering their practical applications. Here, we report a exceptionally huge eCE with a directly measured adiabatic temperature change of up to 57.2 K in a dual-phase all-d-metal Heusler Mn50Ni37.5Ti12.5 polycrystalline alloy, revealing an extra contribution to the latent heat during the stress-induced martensitic transformation from B2 to L10, and breaking the record of adiabatic temperature change for elastocaloric alloys. Moreover, thanks to the combined strengthening effect of d-d hybridization and well-dispersed secondary cubic γ phase, the alloy can endure a uniaxial stress up to 1760 MPa. Such an abnormal huge eCE is attributed to the combination of the enhanced entropy change associated with a stress-induced B2 to L10 martensitic transformation under higher stress, in contrast with the thermally induced B2 to 5-layer modulated structure one, and the high transformation fraction due to the multi-point nucleation facilitated by the γ phase dispersed in the main phase. This work provides insight into making full use of the transformation heat to enhance the caloric effect for high-efficient thermal management systems. © 2025, CC BY.

关键词： Titanium alloys

来源：评论

学校读者我要写书评

暂无评论

A Fusion Tuning Method for Named Entity Recognition 12th

A Fusion Tuning Method for Named Entity Recognition

引用

12th CCF Conference on BigData, BigData 2024

作者： Wang, Jitian Chen, Yanping Zou, Anqi Qin, Yongbin Huang, Ruizhang Text Computing and Cognitive Intelligence Engineering Research Center of National Education Ministry Guizhou University Guiyang550025 China State Key Laboratory of Public Big Data Guizhou University Guiyang China College of Computer Science and Technology Guizhou University Guiyang550025 China

ISBN: (纸本)9789819610235

In named entity recognition, the main methods for constructing deep neural networks are fine-tuning and prompt tuning. Fine-tuning is a commonly used paradigm to optimize neural networks by using task-specific objective functions to make them more adapted to solve downstream tasks. In which pre-trained language models are used as external resources to provide contextual representations. Prompt tuning is a recent paradigm in which the downstream tasks are reformulated to look more like those solved during the original PLM training with the help of a textual prompt. It is effective to utilize potential knowledge of PLMs. In this paper, we propose the fusion approach, which sufficiently fuses the semantics obtained by extracting fine-tuning and prompt-tuning. In our approach, the model makes decisions based on the information obtained from the reconstructive fusion of the fine-tuned semantics and the semantics of the pre-trained language model. The representation obtained by fine-tuning and the representation obtained by prompt tuning are reconstructed into a multidimensional semantics using a gate fusion module (GFM). In particularly, our model has two gate components, one gate to extract the semantics of fine-tuning and the other gate to extract the semantics of prompt tuning, and finally the reconstructed semantic representation is obtained. This takes full advantage of the potential knowledge of PLM. Our model is evaluated on the CONLL2003, ACE2005 and GENIA corpora. It achieves performance close to the state-of-the-art in F1 scores. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Cooperative computing Techniques for a Deeply Fused and Heterogeneous Many-Core Processor Architecture

引用

Journal of Computer Science & Technology 2015年第1期30卷 145-162页

作者：郑方李宏亮吕晖过锋许晓红谢向辉 State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 214125 China

Due to advances in semiconductor techniques, many-core processors have been widely used in high performance computing. However, many applications still cannot be carried out efficiently due to the memory wall, which has become a bottleneck in many-core processors. In this paper, we present a novel heterogeneous many-core processor architecture named deeply fused many-core （DFMC） for high performance computing systems. DFMC integrates management processing ele- ments （MPEs） and computing processing elements （CPEs）, which are heterogeneous processor cores for different application features with a unified ISA （instruction set architecture）, a unified execution model, and share-memory that supports cache coherence. The DFMC processor can alleviate the memory wall problem by combining a series of cooperative computing techniques of CPEs, such as multi-pattern data stream transfer, efficient register-level communication mechanism, and fast hardware synchronization technique. These techniques are able to improve on-chip data reuse and optimize memory access performance. This paper illustrates an implementation of a full system prototype based on FPGA with four MPEs and 256 CPEs. Our experimental results show that the effect of the cooperative computing techniques of CPEs is significant, with DGEMM （double-precision matrix multiplication） achieving an efficiency of 94%, FFT （fast Fourier transform） obtaining a performance of 207 GFLOPS and FDTD （finite-difference time-domain） obtaining a performance of 27 GFLOPS.

关键词： heterogeneous many-core processor data stream transfer register-level communication mechanism hardwaresynchronization technique processor prototype

来源：评论

学校读者我要写书评

暂无评论

Extracting embedded messages using adaptive steganography based on optimal syndrome-trellis decoding paths

引用

Digital Communications and Networks 2022年第4期8卷 455-465页

作者： Jialin Li Xiangyang Luo Yi Zhang Pei Zhang Chunfang Yang Fenlin Liu State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450000China

Privacy protection is the key to maintaining the Internet of Things(IoT)communication *** is an important way to achieve covert communication that protects user data *** technology is the key to checking steganography security,and its ultimate goal is to extract embedded *** methods cannot extract under known cover *** this end,this paper proposes a method of extracting embedded messages under known cover ***,the syndrome-trellis encoding process is ***,a decoding path in the syndrome trellis is obtained by using the stego sequence and a certain parity-check matrix,while the embedding process is simulated using the cover sequence and parity-check *** the decoding path obtained by the stego sequence and the correct parity-check matrix is optimal and has the least distortion,comparing the path consistency can quickly filter the coding parameters to determine the correct matrices,and embedded messages can be extracted *** proposed method does not need to embed all possible messages for the second time,improving coding parameter recognition *** experimental results show that the proposed method can identify syndrome-trellis coding parameters in stego images embedded by adaptive steganography quickly to realize embedded message extraction.

关键词： Information security Image steganography STC coding Parameter recognition

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：