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

IEEE International Conference on Mechatronics and Automation

作者： Wenjing Niu Xin Guo Wenyuan Liang Peng Fang School of Artificial Intelligence and Data Science Hebei University of Technology Tianjin China Ministry of Education Engineering Research Center for Intelligent Rehabilitation Device and Detection Technology Tianjin China Qinhuangdao Research Institute of National Rehabilitation Aids Research Center Qinhuangdao China National Research Center for Rehabilitation Aids Beijing China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China

ISBN: (数字)9798350388077

ISBN: (纸本)9798350388084

This paper analyzes in detail the forward kinematics of 6-PUS parallel mechanism using MATLAB , SolidWorks and Adams software. The proposed algorithm combines the BP Neural Network with the Newton-Raphson method to form BP-NR algorithm. The BP neural network computes an approximation of the kinematic forward solution of the mechanism, which is used as the initial value of Newton-Raphson method for iterative computation to obtain the exact solution. Simulation verification shows that the BP-NR algorithm can simultaneously achieve high accuracy and real-time performance.

关键词： Accuracy Neural networks Software algorithms Kinematics approximation algorithms Prediction algorithms Software

来源：评论

学校读者我要写书评

暂无评论

Walking Optimization Algorithm for Humanoid Robots Using Genetic Algorithm

Walking Optimization Algorithm for Humanoid Robots Using Gen...

引用

International Conference on Control, Decision and Information Technologies (CoDIT)

作者： F. S. Chagas L. D. P. de Farias A. A. A. Bechina A. L. L. Ramos P. F. F. Rosa Department of Science and Industry Systems Faculty of Technology Natural Sciences and Maritime Sciences University of South-Eastern Norway Kongsberg Norway Department of Mechanical Engineering Military Institute of Engineering (IME) Rio de Janeiro Brazil Graduate Program in Defense Engineering Military Institute of Engineering (IME) Rio de Janeiro Brazil

ISBN: (数字)9798350373974

ISBN: (纸本)9798350373981

This paper proposes an algorithm to optimize the walking of humanoid robots based on the inverse kinematic model combined with a Genetic Algorithm. The objectives are to improve the sagittal displacement of the robot and reduce possible lateral deviations during a predetermined path. The foot of the humanoid performs a tapered motion, an approximate ellipse. Horizontal and vertical speeds and the angulation of the humanoid trunk are the input parameters of the algorithm. The algorithm utilizes the input information to calculate the inverse kinematics, and then it submits the obtained result to an evaluation function. We develop a virtual simulator and a robotic platform with 14 degrees of freedom to validate the proposed algorithm. We then test a prototype using the best result obtained in the simulations.

关键词： Legged locomotion Humanoid robots Prototypes Kinematics approximation algorithms Genetics Information technology Biological cells Optimization Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Multi-Source Shortest Paths Mining Algorithm for Unweighted Directed Graphs Based on Rough Sets Theory

Multi-Source Shortest Paths Mining Algorithm for Unweighted ...

引用

Computers and Artificial Intelligence Technologies (CAIT), International Conference on

作者： Wen Zhou Taihua Xu Lisi Dai Jianjun Chen Jingjing Song School of Computer Jiangsu University of Science and Technology Zhenjiang China Department of Computer and Internet of Things Chongqing Institute of Engineering Chongqing China

ISBN: (数字)9798331530891

ISBN: (纸本)9798331530907

Shortest path mining is one of the classic problems in graph theory. How to design an efficient multi-source shortest paths mining algorithm has practical significance. In this article, an efficient multi-source shortest paths algorithm is designed based on rough sets theory. Firstly, within the framework of rough sets theory, investigation has been conducted on the multisource shortest paths, providing a theoretical basis for calculating multi-source shortest paths. Secondly, the R-related set operator is used to search all vertices reachable from each source vertex. Meanwhile, the k-step upper approximation operator is used to search for all vertices that can reach the target vertex. Then, a marking strategy is designed to control the construction of multi-source shortest paths, which can improve the mining efficiency. Finally, a multi-source shortest paths algorithm for unweighted directed graphs (RMSSP) based on rough sets theory is proposed. Experimental results show that the RMSSP algorithm can accurately discover multi-source shortest paths for unweighted directed graphs. Also, it performs better than similar algorithms in terms of computational efficiency. With the expansion of the dataset size, the efficiency advantage of RMSSP algorithm is more obvious.

关键词： Computers Directed graphs Rough sets approximation algorithms Computational efficiency Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

3D Near-field Fast Imaging Method for MMW MIMO Array Radar

3D Near-field Fast Imaging Method for MMW MIMO Array Radar

引用

Signal, Information and Data Processing (ICSIDP), IEEE International Conference on

作者： Shuliang Gui Yue Li Hailiang Nie Zhiqin Zhao Luhong Fan Zengshan Tian Guangdong Institute of Electronic Information Engineering University of Electronic Science and Technology of China Dongguan China School of Communications and Information Engineering Chongqing University of Posts and Telecommunications China School of Electronic Science and Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (数字)9798331515669

ISBN: (纸本)9798331515676

This paper proposes a three dimensional (3D) fast imaging algorithm for multiple inputs and multiple outputs (MIMO) array radar based on 3D wavenumber support domain approximation. Firstly, the MIMO array radar system and echo signal model are introduced and extended into the wavenumber support domain form. Then, the Born approximation theory of 3D wavenumber support domain of reference point for MIMO array is established to fast imaging. Based on that, the 3D fast imaging results with reference points of different sub-scenes are splicing and fusing to reconstruct the fine imaging result to eliminate the distortion and defocus caused by the approximation phase error. Finally, a real imaging experiments are conducted with a millimeter-wave MIMO array near field imaging system to demonstrate the performance and feasibility of the proposed algorithm.

关键词： Three-dimensional displays Image resolution Filtering Splicing Imaging Metals Radar imaging approximation algorithms Radar signal processing Signal resolution

来源：评论

学校读者我要写书评

暂无评论

Approximating the System Behavior with Input Uncertainty Using Big Data

Approximating the System Behavior with Input Uncertainty Usi...

引用

International Conference on Control and Automation (ICCA)

作者： Yitao Yan Jie Bao Biao Huang School of Chemical Engineering The University of New South Wales NSW Australia Department of Chemical and Materials Engineering University of Alberta Edmonton AB Canada

ISBN: (数字)9798350354409

ISBN: (纸本)9798350354416

This paper aims to construct a representation to approximate the behavior of linear time-invariant systems from a large data set whose input contains unmeasured uncertainty and output is subject to measurement noise. Using big data combined with the statistical properties of the input uncertainty and measurement noise, the covariance of the input uncertainty and the output can be approximated. This enables the construction of an approximate covariance of the trajectories in the data set, through which a representation for the approximation of system behavior is obtained. The behavior of this representation is shown to converge in probability to the true behavior. An illustrative example is provided to show that the proposed representation is able to predict the system trajectory to a satisfactory accuracy. The result of this paper provides a potential basis for the development of data-based trajectory estimation and predictive control algorithm when the system input uncertainty is unmeasured.

关键词： Uncertainty Measurement uncertainty Noise Estimation Big Data approximation algorithms Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

Fluid-Antenna Enhanced Integrated Sensing and Communication: Joint Antenna Positioning and Beamforming Design

Fluid-Antenna Enhanced Integrated Sensing and Communication:...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Tian Hao Changxin Shi Yinghong Guo Bin Xia Feng Yang Institute of Wireless Communication Technologies Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350378412

ISBN: (纸本)9798350378429

This paper investigates a fluid antenna (FA) enhanced integrated sensing and communication (ISAC) system consisting of a base station (BS), multiple single-antenna communication users, and one point target, where the BS is equipped with FAs to enhance both the communication and sensing performance. First, we formulate a problem that maximizes the radar signal-to-noise ratio (SNR) by jointly optimizing the FAs’ positions and transmit beamforming matrix. Then, to tackle this highly non-convex problem, we present efficient algorithms by using alternating optimization (AO), successive convex approximation (SCA), and semi-definite relaxation (SDR). Numerical results demonstrate the convergence behavior and effectiveness of the proposed algorithm.

关键词： Array signal processing Transmitting antennas Radar detection Radar Quality of service Integrated sensing and communication approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

TWENTY-FIVE YEARS OF GREEDY BASES

arXiv

引用

arXiv 2024年

作者： Albiac, Fernando Ansorena, José L. Temlyakov, Vladimir Department of Mathematics Statistics and Computer Sciencies–InaMat2 Universidad Pública de Navarra Campus de Arrosadía Pamplona31006 Spain Department of Mathematics and Computer Sciences Universidad de La Rioja Logroño26004 Spain Deparment of Mathematics University of South Carolina ColumbiaSC29208 United States Steklov Mathematical Institute Russian Academy of Sciences Moscow Russia Lomonosov Moscow State University Moscow Center of Fundamental and Applied Mathematics Russia

Although the basic idea behind the notion of a greedy basis had been around for some time, the formal development of a theory of greedy bases was initiated in 1999 with the publication of the article [46] by Konyagin and Temlyakov. The theoretical simplicity of the thresholding greedy algorithm became a model for a procedure widely used in numerical applications and the subject of greedy bases evolved very rapidly from the point of view of approximation theory. The idea of studying greedy bases and related greedy algorithms attracted also the attention of researchers with a classical Banach space theory background. From the more abstract point of functional analysis, the theory of greedy bases and its derivates evolved very fast as many fundamental results were discovered and new ramifications branched out. Hundreds of papers on greedy-like bases and several monographs have been written since the appearance of the foundational paper [46]. After twenty five years, the theory is very much alive and it continues to be a very active research topic both for functional analysts and for researchers interested in the applied nature of nonlinear approximation alike. This is why we believe it is a good moment to gather a selection of 25 open problems (one per year since 1999!) whose solution would contribute to advance the state of art of this beautiful *** Codes 41A65 (Primary) 41A25, 41A46, 41A17, 46B15 (Secondary) Copyright © 2024, The Authors. All rights reserved.

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive Orthogonal Gradient Algorithm Based on Fair Cost Function

Adaptive Orthogonal Gradient Algorithm Based on Fair Cost Fu...

引用

International Electrical Engineering Congress (iEECON)

作者： Suchada Sitjongsataporn Theerayod Wiangtong Dept. of Electronic Engineering Faculty of Engineering and Technology Mahanakorn Institute of Innovation (MII) Mahanakorn University of Technology Bangkok Thailand Dept. of Electrical Engineering School of Engineering King Mongkut's Institute of Technology Ladkrabang Bangkok Thailand

ISBN: (数字)9798350383591

ISBN: (纸本)9798350383607

This paper presents an adaptive orthogonal gradient algorithm with the unconstrained Fair cost function. An adaptive orthogonal gradient-based algorithm is investigated with the help of orthogonal projection mechanism to update the approximate tap-weight vector for the convergence enhancement. Fair cost function is preferable with a smooth points that is able to detect the statistical characteristics of error. Objective of this work is to present an adaptive orthogonal gradient algorithm using Fair cost function (OGA-Fair) to enhance the performance. Simulation results show that proposed adaptive OGA-Fair algorithm can perform with the fast convergence rate and robustness better than the existing method.

关键词： Electrical engineering Simulation Cost function approximation algorithms Vectors Robustness System identification

来源：评论

学校读者我要写书评

暂无评论

A Novel Lorenz-Rossler-Chan (LRC) Algorithm for Efficient Chaos-Based Voice Encryption

A Novel Lorenz-Rossler-Chan (LRC) Algorithm for Efficient Ch...

引用

Advances in Engineering Science and Technology (AEST), International Conference on

作者： Ameer k. Jawad Gholamreza Karimi Mazdak Radmalekshahi Electrical Engineering Department Faculty of Electrical and Computer Engineering Razi University Kermanshah Iran

ISBN: (数字)9798331502690

ISBN: (纸本)9798331502706

In recent years, many proposed algorithms have been used to enhance the performance of voice encryption over public communication channels. This paper introduces the novel Lorenz-Rossler-Chan (LRC) algorithm for voice encryption using three chaotic system generators: Lorenz, Rossler, and Chen. The LRC chaotic system combines cascaded chaotic signals from these generators to enhance encryption performance and increase the key space. The simulation results demonstrate the effectiveness of the LRC algorithm. Encrypted voice signals exhibit significantly negative signal-to-noise ratio (SNR), and zero correlation values showcase negligible similarities, highlighting a substantial difference between the original and encrypted voice signals, indicating robust encryption. The proposed LRC algorithm is also well suited for real-time applications because of its minimal time delay during encryption and decryption, which further hinders decryption. With a key space of approximately 1196 bits, the LRC algorithm has strong security.

关键词： Correlation Chaotic communication Simulation Delay effects Communication channels approximation algorithms Real-time systems Generators Encryption Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Joint Power Allocation and Passive Beamforming for Distributed RIS Multiuser Networks

Joint Power Allocation and Passive Beamforming for Distribut...

引用

IEEE International Conference on Signal and Image Processing (ICSIP)

作者： Zhen Chen Zhenqiu Jian Kai Fang Department of Electronic Engineering City University of Hong Kong Hong Kong China School of Information and Communication Engineering Shenzhen University Shenzhen China School of Electronic and Information Engineering South China University of Technology Guangzhou China

ISBN: (数字)9798350350920

ISBN: (纸本)9798350350937

Distributed reconfigurable intelligent surfaces (RISs) provide rich macro-diversity coverage due to different locations of the RISs, which is beneficial to combat coverage holes. However, the system performance relies on the effective coordination of multiple RISs. Thus, the resource allocation scheme for distributed RIS-assisted multiuser system is a crucial challenge. To tackle these issues, joint power allocation, phase shifts and communication scheduling design for distributed RIS-assisted systems is investigated in this paper, where all RISs simultaneously and cooperatively serve multiple users. To overcome the formulated nonconvex maximization problem, the original maximization problem is decoupled into three subproblems and solved in an iterative manner. Numerical simulations are conducted to demonstrate that the considered solution outperforms the existing benchmark and achieves a near-optimal sum rate.

关键词： System performance Simulation Image processing Reconfigurable intelligent surfaces Benchmark testing approximation algorithms Numerical simulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：