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

Securing Neural Network in the Cloud: A Systematic Approach of Cloud Security Based on ANN-SVM Model 4

学校读者我要写书评

暂无评论

Securing Neural Network in the Cloud: A Systematic Approach ...

4th International Conference on Sustainable Expert Systems, ICSES 2024

作者： Arunarani, Ar Vijayagopal, V. Kartheesan, L. Dwivedi, Vijay Kumar Rajesh Kumar, A. Nishant, Neerav School of Computing College of Engineering Srm Institute of Science and Technology Department of Computational Intelligence Tamilnadu Chennai India Dr. M.G.R. Educational and Research Institute Faculty of Computer Applications Tamilnadu Chennai India School of Computing Vel Tech Rangarajan Dr. Sagunthala R&d Institute of Science and Technology Department of Computer Science and Engineering Tamilnadu Chennai India Vishwavidyalaya Engineering College Department of Mathematics Chhattisgarh Surguja India N.S.N. College of Engineering and Technology Department of Computer Science and Engineering Tamilnadu Karur India School of Engineering Babu Banarasi Das University Department of Computer Science and Engineering Lucknow India

ISBN: (纸本)9798331540364

Many services have made the transition to the cloud because of the increased reliability and efficiency of cloud computing. Due to their capacity to ease service access while also securing communications in the public network, the three-factor Mutual Authentication and Key Agreement (MAKA) protocols are seeing increased use in multi-server designs. A lack of formal security proof or high communication and computation costs makes the limited three-factor MAKA protocols that are currently available susceptible to a wide range of attacks. The proposed approach consists of three phases, which are preprocessing, feature selection, and model training. Text scheduling and normalization make up preprocessing. In feature selection, the PSO is an optimization method that uses a population-based approach to find optimal solutions. An ANN-SVM was employed throughout the model's training phase. With an average accuracy of 93.30%, the proposed technique surpasses ANN and SVM. © 2024 IEEE.

关键词： Cloud security

Covariance-Based Device Activity Detection with Massive MIMO for Near-Field Correlated Channels

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Ziyue Li, Yang Liu, Ya-Feng Ma, Junjie The 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 The Shenzhen Research Institute of Big Data Shenzhen518172 China The School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China

This paper studies the device activity detection problem in a massive multiple-input multiple-output (MIMO) system for near-field communications (NFC). In this system, active devices transmit their signature sequences to the base station (BS), which detects the active devices based on the received signal. In this paper, we model the near-field channels as correlated Rician fading channels and formulate the device activity detection problem as a maximum likelihood estimation (MLE) problem. Compared to the traditional uncorrelated channel model, the correlation of channels complicates both algorithm design and theoretical analysis of the MLE problem. On the algorithmic side, we propose two computationally efficient algorithms for solving the MLE problem: an exact coordinate descent (CD) algorithm and an inexact CD algorithm. The exact CD algorithm solves the one-dimensional optimization subproblem exactly using matrix eigenvalue decomposition and polynomial root-finding. By approximating the objective function appropriately, the inexact CD algorithm solves the one-dimensional optimization subproblem inexactly with lower complexity and more robust numerical performance. Additionally, we analyze the detection performance of the MLE problem under correlated channels by comparing it with the case of uncorrelated channels. The analysis shows that when the overall number of devices N is large or the signature sequence length L is small, the detection performance of MLE under correlated channels tends to be better than that under uncorrelated channels. Conversely, when N is small or L is large, MLE performs better under uncorrelated channels than under correlated ones. Simulation results demonstrate the computational efficiency of the proposed algorithms and verify the correctness of the analysis. Copyright © 2024, The Authors. All rights reserved.

关键词： Eigenvalues and eigenfunctions

Energetic Spectral-Element Time Marching Methods for Phase-Field Nonlinear Gradient Systems

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Shiqin Yu, Haijun School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China LSEC & NCMIS Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Beijing100190 China

We propose two efficient energetic spectral-element methods in time for marching nonlinear gradient systems with the phase-field Allen–Cahn equation as an example: one fully implicit nonlinear method and one semi-implicit linear method. Different from other spectral methods in time using spectral Petrov-Galerkin or weighted Galerkin approximations, the presented implicit method employs an energetic variational Galerkin form that can maintain the mass conservation and energy dissipation property of the continuous dynamical system. Another advantage of this method is its superconvergence. A high-order extrapolation is adopted for the nonlinear term to get the semi-implicit method. The semi-implicit method does not have superconvergence, but can be improved by a few Picard-like iterations to recover the superconvergence of the implicit method. Numerical experiments verify that the method using Legendre elements of degree three outperforms the 4th-order implicit-explicit backward differentiation formula and the 4th-order exponential time difference Runge-Kutta method, which were known to have best performances in solving phase-field equations. In addition to the standard Allen–Cahn equation, we also apply the method to a conservative Allen–Cahn equation, in which the conservation of discrete total mass is verified. The applications of the proposed methods are not limited to phase-field Allen–Cahn equations. They are suitable for solving general, large-scale nonlinear dynamical systems. © 2024, CC BY-NC-SA.

关键词： Nonlinear dynamical systems

Can Efficient Fourier-Transform Techniques Favorably Impact on Broadband computational Electromagnetism?

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Anderson, Thomas G. Lyon, Mark Yin, Tao Bruno, Oscar P. Department of Computational Applied Mathematics and Operations Research Rice University Houston77098 United States Department of Mathematics & Statistics University of New Hampshire Durham03824 United States LSEC Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Department of Computing and Mathematical Sciences California Institute of Technology Pasadena91125 United States

In view of recently demonstrated joint use of novel Fourier-transform techniques and effective high-accuracy frequency domain solvers related to the Method of Moments, it is argued that a set of trans-formative innovations could be developed for the effective, accurate and efficient simulation of problems of wave propagation and scattering of broadband, time-dependent wavefields. This contribution aims to convey the character of these methods and to highlight their applicability in computational modeling of electromagnetic configurations across various fields of science and *** Codes 65R10, 65R20 Copyright © 2024, The Authors. All rights reserved.

关键词： Frequency domain analysis

SCALING OPTIMIZED HERMITE APPROXIMATION METHODS

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Hu, Hao Yu, Haijun School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China NCMIS & LSEC Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Beijing100190 China

Hermite polynomials and functions have extensive applications in scientific and engineering problems. While it is recognized that employing the scaled Hermite functions rather than the standard ones can remarkably enhance the approximation performance, the understanding of the scaling factor remains insufficient. Due to the lack of theoretical analysis, some literature still cast doubts on whether the Hermite spectral method is inferior to other methods. To dispel these doubts, we show in this article that the inefficiency of the Hermite spectral method comes from the imbalance in the decay speed of the objective function within the spatial and frequency domains. Moreover, proper scaling can render the Hermite spectral methods comparable to other methods. To illustrate this idea in more detail, we propose a novel error analysis framework for the scaled Hermite approximation. Taking the L2 projection error as an example, our framework illustrates that there are three different components of errors: the spatial truncation error, the frequency truncation error, and the Hermite spectral approximation error. Through this perspective, finding the optimal scaling factor is equivalent to balancing the spatial and frequency truncation error. As applications, we show that geometric convergence can be recovered by proper scaling for a class of functions. Furthermore, we show that proper scaling can double the convergence order for smooth functions with algebraic decay. The perplexing pre-asymptotic sub-geometric convergence when approximating algebraic decay functions can be perfectly explained by this *** Codes 65N35, 33C45, 42C05 © 2024, CC BY-SA.

关键词： Error analysis

CPAFT: A Consistent Parallel Advancing Front Technique for Unstructured Triangular/Tetrahedral Mesh Generation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ma, Chengdi Huang, Jizu Luo, Hao Yang, Chao School of Mathematical Sciences Peking University Beijing100871 China Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China PKU-Changsha Institute for Computing and Digital Economy Peking University Hunan410006 China

Compared with the remarkable progress made in parallel numerical solvers of partial differential equations, the development of algorithms for generating unstructured triangular/tetrahedral meshes has been relatively sluggish. In this paper, we propose a novel, consistent parallel advancing front technique (CPAFT) by combining the advancing front technique, the domain decomposition method based on space-filling curves, the distributed forest-of-overlapping-trees approach, and the consistent parallel maximal independent set algorithm. The newly proposed CPAFT algorithm can mathematically ensure that the generated unstructured triangular/tetrahedral meshes are independent of the number of processors and the implementation of domain decomposition. Several numerical tests are conducted to validate the parallel consistency and outstanding parallel efficiency of the proposed algorithm, which scales effectively up to two thousand processors. This is, as far as we know, the first parallel unstructured triangular/tetrahedral mesh generator with scalability to O(1,000) CPU *** Codes 65M50, 65M55, 68W10 Copyright © 2024, The Authors. All rights reserved.

关键词： Domain decomposition methods

QoS-Aware and Routing-Flexible Network Slicing for Service-Oriented Networks

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Chen, Wei-Kun Liu, Ya-Feng Dai, Yu-Hong Luo, Zhi-Quan The School of Mathematics and Statistics Beijing Key Laboratory on MCAACI Beijing Institute of Technology Beijing100081 China The 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 The Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen518172 China

In this paper, we consider the network slicing (NS) problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and manage network resources to meet diverse quality of service (QoS) requirements. We propose a mixed-integer nonlinear programming (MINLP) formulation for the considered NS problem that can flexibly route the traffic flow of the services on multiple paths and provide end-to-end delay and reliability guarantees for all services. To overcome the computational difficulty due to the intrinsic nonlinearity in the MINLP formulation, we transform the MINLP formulation into an equivalent mixed-integer linear programming (MILP) formulation and further show that their continuous relaxations are equivalent. In sharp contrast to the continuous relaxation of the MINLP formulation which is a nonconvex nonlinear programming problem, the continuous relaxation of the MILP formulation is a polynomial-time solvable linear programming problem, which significantly facilitates the algorithmic design. Based on the newly proposed MILP formulation, we develop a customized column generation (cCG) algorithm for solving the NS problem. The proposed cCG algorithm is a decomposition-based algorithm and is particularly suitable for solving large-scale NS problems. Numerical results demonstrate the efficacy of the proposed formulations and the proposed cCG algorithm. Copyright © 2024, The Authors. All rights reserved.

关键词： Mixed-integer linear programming

An Effective Two-Stage Column Generation Strategy for Solving Unit Commitment

学校读者我要写书评

暂无评论

An Effective Two-Stage Column Generation Strategy for Solvin...

IEEE Conference on Energy Internet and Energy System Integration (EI2)

作者： Zhao-Gang Su Sheng-Jie Chen Yu-Fei Li Liang Chen Jia-Yi Deng 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

ISBN: (数字)9798331523527

ISBN: (纸本)9798331523534

Unit commitment (UC) has been extensively studied in power systems literature and is typically formulated as a mixed-integer programming (MIP) problem. However, existing methods and commercial MIP solvers often struggle to efficiently solve large-scale UC instances. This paper proposes a novel MIP model for addressing UC by employing an innovative column generation-based two-stage approach to efficiently compute high-quality solutions. Our method leverages parallel computing to solve pricing problems and generate columns effectively. Following column generation, we solve the master problem as a MIP model to obtain high-quality feasible solutions for the UC problem. Comprehensive numerical experiments demonstrate that our proposed method can effectively tackle large-scale UC problems involving over 1,000 units, significantly outperforming state-of-the-art MIP solvers in both solution quality and computational efficiency. The results underscore the potential of our approach for practical application in large-scale power system scheduling.

关键词： Processor scheduling computational modeling Refining Pricing System integration Parallel processing Programming computational efficiency Power system reliability Reliability

Asymptotic SEP Analysis and Optimization of Linear-Quantized Precoding in Massive MIMO Systems

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wu, Zheyu Ma, Junjie Liu, Ya-Feng Swindlehurst, A. Lee The 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 The Center for Pervasive Communications and Computing University of California IrvineCA92697 United States

A promising approach to deal with the high hardware cost and energy consumption of massive MIMO transmitters is to use low-resolution digital-to-analog converters (DACs) at each antenna element. This leads to a transmission scheme where the transmitted signals are restricted to a finite set of voltage levels. This paper is concerned with the analysis and optimization of a low-cost quantized precoding strategy, referred to as linear-quantized precoding, for a downlink massive MIMO system under Rayleigh fading. In linear-quantized precoding, the signals are first processed by a linear precoding matrix and subsequently quantized component-wise by the DAC. In this paper, we analyze both the signal-to-interference-plus-noise ratio (SINR) and the symbol error probability (SEP) performances of such linear-quantized precoding schemes in an asymptotic framework where the number of transmit antennas and the number of users grow large with a fixed ratio. Our results provide a rigorous justification for the heuristic arguments based on the Bussgang decomposition that are commonly used in prior works. Based on the asymptotic analysis, we further derive the optimal precoder within a class of linear-quantized precoders that includes several popular precoders as special cases. Our numerical results demonstrate the excellent accuracy of the asymptotic analysis for finite systems and the optimality of the derived precoder. Copyright © 2023, The Authors. All rights reserved.

关键词： MIMO systems