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

arXiv 2023年

作者： Xie, Pengcheng Yuan, Ya-Xiang State Key Laboratory of Scientific/Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Zhong Guan Cun Donglu No.55 Beijing China University of Chinese Academy of Sciences Zhong Guan Cun Donglu No.55 Beijing China

This paper proposes the method 2D-MoSub (2-dimensional model-based subspace method), which is a novel derivative-free optimization (DFO) method based on the subspace method for general unconstrained optimization and especially aims to solve large-scale DFO problems. Our method combines 2-dimensional quadratic interpolation models and trust-region techniques to iteratively update the points and explore the 2-dimensional subspace. Its framework includes initialization, constructing the interpolation set, building the quadratic interpolation model, performing trust-region trial steps, and updating the trust-region radius and subspace. We introduce the framework and computational details of 2D-MoSub, and discuss the poisedness and quality of the interpolation set in the corresponding 2-dimensional subspace. We also analyze some properties of our method, including the model’s approximation error with projection property and the algorithm’s convergence. Numerical results demonstrate the effectiveness and efficiency of 2D-MoSub for solving a variety of unconstrained optimization *** Codes 90C56, 90C30, 65K05, 90C90 Copyright © 2023, The Authors. All rights reserved.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

tSS-BO: Scalable Bayesian Optimization for Analog Circuit Sizing via Truncated Subspace Sampling

tSS-BO: Scalable Bayesian Optimization for Analog Circuit Si...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Tianchen Gu Jiaqi Wang Zhaori Bi Changhao Yan Fan Yang Yajie Qin Tao Cui Xuan Zeng State Key Laboratory of Integrated Chips and Systems School of Microelectronics Fudan University Shanghai China State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences & University of Chinese Academy of Sciences Beijing China State Key Laboratory of Integrated Chips and Systems School of Information Science and Technology Fudan University Shanghai China

ISBN: (数字)9783981926385

ISBN: (纸本)9798350348606

We propose a novel scalable Bayesian optimization method with truncated subspace sampling (tSS-BO) to tackle high-dimensional optimization challenges for large-scale analog circuit sizing. To address the high-dimensional challenges, we propose subspace sampling subject to a truncated Gaussian distribution. This approach limits the effective sampling dimensionality down to a constant upper bound, independent of the original dimensionality, leading to a significant reduction in complexity associated with the curse of dimensionality. The distribution covariance is iteratively updated using a truncated flow, where approximate gradients and center steps are integrated with decaying prior subspace features. We introduce gradient sketching and local Gaussian process (GP) models to approximate gradients without additional simulations to mitigate systematic errors. To enhance efficiency and ensure compatibility with constraints, we utilize local GP models for the selection of promising candidates, avoiding the cost of acquisition function optimization. The proposed tSS-BO method exhibits clear advantages over state-of-the-art methods in experimental comparisons. In synthetic benchmark functions, the tSS-BO method achieves up to $4.93\times$ evaluation speedups and a remarkable over $30\times$ algorithm complexity reduction compared to the Bayesian baseline. In real-world analog circuits, our method achieves up to $2\times$ speedups in simulation number and runtime.

关键词： Adaptation models Upper bound Runtime Systematics Optimization methods Gaussian processes Analog circuits

来源：评论

学校读者我要写书评

暂无评论

Verify All Traffic: Towards Zero-Trust In-Network Intrusion Detection against Multipath Routing

引用

IEEE Journal on Selected Areas in Communications 2025年第6期43卷 2155-2171页

作者： Zhao, Ziming Li, Zhaoxuan Xie, Xiaofei Liu, Zhipeng Li, Tingting Yu, Jiongchi Zhang, Fan Chen, Binbin School of Software Technology Zhejiang University Ningbo315100 China College of Computer Science and Technology Zhejiang University Hangzhou310027 China ZJU-Hangzhou Global Scientific and Technological Innovation Center 311200 China Key Laboratory of Blockchain and Cyberspace Governance of Zhejiang Province 310027 China Jiaxing Research Institute Zhejiang University 314000 China Zhengzhou Xinda Institute of Advanced Technology Zhengzhou450001 China Singapore State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Cyber Security UCAS Beijing100049 China School of Computing and Information Systems Singapore Management University Singapore188065 Singapore Advanced Digital Sciences Center Singapore138632 Singapore Singapore University of Technology and Design SingaporeB96049 Singapore

With the popularity of encryption protocols, machine learning (ML)-based traffic analysis technologies have attracted widespread attention. To adapt to modern high-speed bandwidth, recent research is dedicated to advancing zero-trust intrusion detection by offloading feature extraction and model inference into the network dataplane. Especially, with the rise of programmable switches, achieving line-speed ML inference becomes promising. However, existing research only considers a single switch node as a relay to conduct evaluation. This is far from real-world deployments involving multiple switches (given that zero-trust security assumes that threats can originate from anywhere, including within the network), particularly the multi-path routing phenomenon that exists in practice. In this paper, we reveal practical challenges in the context of enabling line-speed model inference in the network dataplane. Furthermore, we propose FCPlane, the forwarding and computing integrated dataplane for zero-trust intrusion detection that aims to enable efficient load balancing while providing reliable traffic analysis results, even against multipath routing. The core idea is to reconcile forwarding and computation to the flowlet level, for which a tailor-made Markov chain model is designed. Based on two public traffic datasets, we evaluate seven state-of-the-art in-network traffic analysis models deployed in four types of topologies (three with multipath routing and one without) to explore performance impact and demonstrate the effectiveness of our proposal. © 1983-2012 IEEE.

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

A hierarchical access control and sharing model for healthcare data with on-chain-off-chain collaboration

引用

Journal of Intelligent and Fuzzy Systems 2025年第3期48卷 215-231页

作者： Dong, Jianhang Jiang, Rong Zhang, Yi Tian, Shenghu Wu, Bin Faculty of Information Engineering and Automation Kunming University of Science and Technology Kunming China Yunnan Key Laboratory of Service Computing Yunnan University of Finance and Economics Kunming China Institute of Intelligence Applications Yunnan University of Finance and Economics Kunming China Yunnan Academy of Scientific and Technical Information Kunming China

Healthcare data is growing rapidly and data sharing is becoming increasingly important among hospitals. However, traditional methods are prone to data leakage and threaten patient privacy. To ensure data security and realize sharing and access control, combining blockchain technology, attribute-based encryption and ciphertext policy (CP-ABE) and AES symmetric encryption algorithm, this paper proposes a hierarchical attribute-based encryption algorithm based on master-sidechain (MSC-CP-ABE) and a collaborative access control and sharing model with on-chain and off-chain (AC-CSS). The algorithm encrypts hierarchically based on data sensitivity, the ciphertext is stored in the interplanetary file system (IPFS), and the encrypted address and key are stored in the side chain, which is convenient for indexing in the main chain. The vectorized access policy implements policy hiding, combines on-chain and off-chain, saves blockchain space, achieves hierarchical access control, and improves security and efficiency. Simulation experiments show that the main sidechain model proposed in this paper has better performance in terms of transaction delay and throughput. Compared with existing models, the algorithm proposed in this paper has certain advantages in data encryption and decryption time and key generation time. © 2025 – IOS Press. All rights reserved.

关键词： Authorization

来源：评论

学校读者我要写书评

暂无评论

On Underdamped Nesterov’s Acceleration

arXiv

引用

arXiv 2023年

作者： Chen, Shuo Shi, Bin Yuan, Ya-Xiang State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100049 China

The high-resolution differential equation framework has been proven to be tailor-made for Nesterov’s accelerated gradient descent method (NAG) and its proximal correspondence — the class of faster iterative shrinkage thresholding algorithms (FISTA). However, the systems of theories is not still complete, since the underdamped case (r γ or the iteration kγ in the mixed term. When the momentum parameter r is 2, the new Lyapunov functions are identical to the previous ones. These new proofs do not only include the convergence rate of the objective value previously obtained according to the low-resolution differential equation framework but also characterize the convergence rate of the minimal gradient norm square. All the convergence rates obtained for the underdamped case are continuously dependent on the parameter r. In addition, it is observed that the high-resolution differential equation approximately simulates the convergence behavior of NAG for the critical case r = −1, while the low-resolution differential equation degenerates to the conservative Newton’s equation. The high-resolution differential equation framework also theoretically characterizes the convergence rates, which are consistent with that obtained for the underdamped case with r = −1. © 2023, CC BY-SA.

关键词： Differential equations

来源：评论

学校读者我要写书评

暂无评论

Taking Myopic Best Response Against The Hedge Algorithm

Taking Myopic Best Response Against The Hedge Algorithm

引用

第42届中国控制会议

作者： Xinxiang Guo Yifen Mu School of Mathematical Sciences University of Chinese Academy of Sciences The State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems ScienceChinese Academy of Sciences The Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of Sciences

With the rapid development of artificial intelligence(AI),the game between the human and machine/AI becomes more and more *** related theoretical analysis becomes significant and necessary,which however is still *** problem involves evolution analysis and optimal control of dynamic game systems driven by learning *** this paper,we consider a finitely repeated two-player zero-sum *** study the dynamic evolution process of the game system,in which one player employs the Hedge algorithm and the other player takes the myopic best *** the updating formula of the Hedge algorithm,we define a quantity called the state and construct the State Transition Triangle Graph(STTG).Then,we prove that the game system is periodic after o(T) stages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Quantum simulation of a class of highly-oscillatory transport equations via Schrödingerisation

arXiv

引用

arXiv 2025年

作者： Gu, Anjiao Jin, Shi School of Mathematical Sciences Shanghai Jiao Tong University Shanghai200240 China Institute of Natural Sciences Shanghai Jiao Tong University Shanghai200240 China Ministry of Education Key Laboratory in Scientific and Engineering Computing Shanghai200240 China

In this paper, we present quantum algorithms for a class of highly-oscillatory transport equations, which arise in semiclassical computation of surface hopping problems and other related non-adiabatic quantum dynamics, based on the Born-Oppenheimer approximation. Our method relies on the classical nonlinear geometric optics method, and the recently developed Schrödingerisation approach for quantum simulation of partial differential equations. The Schrödingerisation technique can transform any linear ordinary and partial differential equations into Hamiltonian systems evolving under unitary dynamics, via a warped phase transformation that maps these equations to one higher dimension. We study possible paths for better recoveries of the solution to the original problem by shifting the bad eigenvalues in the Schrödingerized system. Our method ensures the uniform error estimates independent of the wave length, thus allowing numerical accuracy, in maximum norm, even without numerically resolving the physical oscillations. Various numerical experiments are performed to demonstrate the validity of this approach. Copyright © 2025, The Authors. All rights reserved.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Detecting and Exploiting Unit Commitment Structures in MIPs 6

Detecting and Exploiting Unit Commitment Structures in MIPs

引用

6th International Conference on Power and Energy Technology, ICPET 2024

作者： Su, Zhao-Gang Chen, Sheng-Jie Li, Yu-Fei Chen, Liang Kou, Caixia Cai, Zhi Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China Institute of Applied Mathematics Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing China College of Sciences Beijing University of Posts and Telecommunications Beijing China Beijing Key Laboratory of Research and System Evaluation of Power Dispatching Automation Technology China Electric Power Research Institute Beijing China

ISBN: (纸本)9798350375855

The unit commitment (UC) problem has been extensively researched in the literature, which is typically formulated as a mixed integer programming (MIP) problem. However, current studies lack effective methods to identify potential UC problem structures within a general MIP problem, making it challenging to leverage well-established valid inequalities for UC problems to accelerate the solution process. In this paper, we present a novel detection method that automatically identifies UC structures within an MIP problem by analyzing the relationships between variables and constraints. Moreover, we enhance the MIP formulation by incorporating three well-studied classes of valid inequalities as cutting planes, based on the identified UC structures. Our experiments demonstrate that our proposed UC detection method greatly improves computational efficacy of a standard MIP solver compared to the default setting. © 2024 IEEE.

关键词： Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

QoS-based Beamforming and Compression Design for Cooperative Cellular Networks via Lagrangian Duality

arXiv

引用

arXiv 2023年

作者： Fan, Xilai Liu, Ya-Feng Liu, Liang Chang, Tsung-Hui State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Department of Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong School of Science and Engineering The Chinese University of Hong Kong Shenzhen Research Institute of Big Data Shenzhen Shenzhen China

This paper considers the quality-of-service (QoS)based joint beamforming and compression design problem in the downlink cooperative cellular network, where multiple relay-like base stations (BSs), connected to the central processor via rate-limited fronthaul links, cooperatively transmit messages to the users. The problem of interest is formulated as the minimization of the total transmit power of the BSs, subject to all users’ signal-to-interference-plus-noise ratio (SINR) constraints and all BSs’ fronthaul rate constraints. In this paper, we first show that there is no duality gap between the considered joint optimization problem and its Lagrangian dual by showing the tightness of its semidefinite relaxation (SDR). Then, we propose an efficient algorithm based on the above duality result for solving the considered problem. The proposed algorithm judiciously exploits the special structure of an enhanced Karush-Kuhn-Tucker (KKT) conditions of the considered problem and finds the solution that satisfies the enhanced KKT conditions via two fixed point iterations. Two key features of the proposed algorithm are: (1) it is able to detect whether the considered problem is feasible or not and find its globally optimal solution when it is feasible;(2) it is highly efficient because both of the fixed point iterations in the proposed algorithm are linearly convergent and evaluating the functions in the fixed point iterations are computationally cheap. Numerical results show the global optimality and efficiency of the proposed algorithm. Copyright © 2023, The Authors. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Multiple-distribution-function lattice Boltzmann method for convection-diffusion-system-based incompressible Navier-Stokes equations

引用

Physical Review E 2022年第5期106卷 055305-055305页

作者： Zhenhua Chai Baochang Shi Chengjie Zhan School of Mathematics and Statistics Huazhong University of Science and Technology Wuhan 430074 China Hubei Key Laboratory of Engineering Modeling and Scientific Computing Huazhong University of Science and Technology Wuhan 430074 China

In this paper, a multiple-distribution-function lattice Boltzmann method (MDF-LBM) with a multiple-relaxation-time model is proposed for incompressible Navier-Stokes equations which are considered as coupled convection-diffusion equations. Through direct Taylor expansion analysis, we show that the Navier-Stokes equations can be recovered correctly from the present MDF-LBM, and additionally, it is also found that the velocity and pressure can be directly computed through the zero and first-order moments of the distribution function. Then in the framework of the present MDF-LBM, we develop a locally computational scheme for the velocity gradient in which the first-order moment of the nonequilibrium distribution is used; this scheme is also extended to calculate the velocity divergence, strain rate tensor, shear stress, and vorticity. Finally, we also conduct some simulations to test the MDF-LBM and find that the numerical results not only agree with some available analytical and numerical solutions but also have a second-order convergence rate in space.

关键词： Lattice-Boltzmann methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：