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

Adaptive milling chatter identification based on sparse dictionary considering noise estimation and critical bandwidth analysis

引用

JOURNAL OF MANUFACTURING PROCESSES 2023年 106卷 328-337页

作者： Wang, Chenxi Zhang, Yuxiang Hu, Jiawei Xi An Jiao Tong Univ Sch Mech Engn Xian 710049 Shaanxi Peoples R China Xian Aerosp Mech & Intelligent Mfg Co Ltd Xian 710100 Shaanxi Peoples R China

As one of the most unfavorable factors, chatter will seriously hinder the improvement of production efficiency. The weak chatter identification is an effective method for stable cutting. In this paper, a weak chatter identification method is developed using sparse dictionary on account of the milling dynamic responses. As the bases for chatter identification, chatter frequencies are calculated based on the milling dynamic equations. In order to decrease false alarm rate due to the measured background noise, the noise estimation based filtering is proposed. Besides, in consideration of the parameter uncertainty, an adaptive critical bandwidth analysis is implemented with the developed energy proportion index in case of missed alarm. Then, the sparse dictionary matrix is constructed based on the obtained chatter frequencies and critical bandwidth. Finally, the gradient projection for sparse reconstruction (gpsr) algorithm is adopted for chatter frequencies extraction. The proposed method can decrease the measured background noise, obtain critical chatter band and extract weak chatter frequencies accurately. Experimental results shows that the developed method can be successful in weak chatter identification.

关键词： Adaptive weak chatter identification Noise estimation Parameter uncertainty Critical bandwidth analysis Energy proportion index Sparse dictionary gpsr algorithm

来源：评论

学校读者我要写书评

暂无评论

Secured Multi-Hop Clustering Protocol for Location-based Routing in VANETs

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2019年第4期10卷 121-126页

作者： Eunice, K. Sushma Juvanna, I Hindustan Inst Technol & Sci IT HITS Chennai Tamil Nadu India

In today's world, with the rise in the count of vehicles and lack of proper navigation, the congestion has become a major problem. In this scenario, VANETs play a very important part in improving the traffic condition and also in providing proper navigation. Improved navigation system reduces congestion thereby reducing the possibility of occurrence of accidents. In this research work, we have used a position-based routing protocol i.e., gpsr (Greedy Perimeter Stateless Routing Protocol) to effectively analyze the geographical position of the vehicles in the network and to provide updated navigation information. In this system, we have used a security mechanism to identify valid and invalid messages for secure V2V and V2I communications. This mechanism drops all the invalid messages thereby keeping the VANET secure. It also reduces the possibility of attacks on wireless communications in the VANET. This system has better safety features and network performance compared to other hybrid schemes via NS2 simulation.

关键词： Vanet tamper-proof device location-based routing protocols intelligent transportation system gpsr algorithm trusted authority roadside unit routing protocols

来源：评论

学校读者我要写书评

暂无评论

Anonymity Protection Using ALERT in MANET 2

Anonymity Protection Using ALERT in MANET

引用

2015 International Conference on Innovations in Information, Embedded and Communication Systems (ICIIECS)

作者： Khasnikar, Aniket K. Yeshwantrao Chavan Coll Engn Dept Comp Sci & Engn Nagpur MH India

ISBN: (纸本)9781479968183

The routing protocols in MANETs(( Mobile Ad-hoc Networks), generates high cost as it depends on hop-by-hop routing which unables to provide anonymity protection to source, destination and routes.), ALERT ( Anonymous Location-Based Efficient Routing Protocol) routing protocol can be used which portioned the network into hierarchical zone partition and also randomly chooses the nodes as intermediate relay nodes. It also hides the data receiver or initiator between many receivers to strengthen source and destination anonymity protection. Thus it provide thwart against many attacks as it provide anonymity protection to sources, destinations and routes.

关键词： Anonymity Protection gpsr algorithm Relay nodes ALERT MANETs

来源：评论

学校读者我要写书评

暂无评论

Anonymity Protection Using ALERT in MANET

Anonymity Protection Using ALERT in MANET

引用

International Conference on Innovations in Information, Embedded and Communication Systems

作者： Aniket K. Khasnikar Dept. of Computer Science and Engineering Yeshwantrao Chavan College of Engineering

ISBN: (纸本)9781479968190

The routing protocols in MANETs ((Mobile Ad-hoc Networks), generates high cost as it depends on hop-by-hop routing which unables to provide anonymity protection to source, destination and routes.), ALERT (Anonymous Location-Based Efficient Routing Protocol) routing protocol can be used which portioned the network into hierarchical zone partition and also randomly chooses the nodes as intermediate relay nodes. It also hides the data receiver or initiator between many receivers to strengthen source and destination anonymity protection. Thus it provide thwart against many attacks as it provide anonymity protection to sources, destinations and routes.

关键词： Anonymity Protection gpsr algorithm Relay nodes ALERT MANETs

来源：评论

学校读者我要写书评

暂无评论

Improved gpsr Routing algorithm and Its Performance Analysis

Improved GPSR Routing Algorithm and Its Performance Analysis

引用

2010 IEEE International Conference on Sofetware Engineering and Service Sciences(2010 软件工程与服务科学国际学术会议 ICSESS)

作者： Cheng Fenhua Jin Min College of Software Hunan University Hunan science Vocational College Changsha China College of Software Hunan University Changsha China

An improved gpsr routing algorithm is proposed to resolve the energy sensing problem of gpsr. In order to balance the energy-consumption of nodes, improved gpsr routing algorithm uses node's remnant energy as one of the key factors to decide next-hop. The improved gpsr routing algorithm keeps the characteristics of gpsr algorithm, such as low complexity, easy realization. Based on NS-2, the performance of improved gpsr routing algorithm is analyzed. Experimental results show that the improved gpsr algorithm can balance the node energy consumption effectively and prolong the time to live of the whole sensor network.

关键词： sensor network routing gpsr algorithm energy

来源：评论

学校读者我要写书评

暂无评论

Improved gpsr Routing algorithm and Its Performance Analysis

Improved GPSR Routing Algorithm and Its Performance Analysis

引用

IEEE BEIJING SECTION(跨国电气电子工程师学会北京分会)

作者： Cheng Fenhua 1 College of Software,Hunan University 2 Hunan science Vocational College Changsha,China Jin Min College of Software,Hunan University Changsha,China

An improved gpsr routing algorithm is proposed to resolve the energy sensing problem of *** order to balance the energy-consumption of nodes,improved gpsr routing algorithm uses node's remnant energy as one of the key factors to decide *** improved gpsr routing algorithm keeps the characteristics of gpsr algorithm,such as low complexity, easy *** on NS-2,the performance of improved gpsr routing algorithm is *** results show that the improved gpsr algorithm can balance the node energy consumption effectively and prolong the time to live of the whole sensor network.

关键词： sensor network routing gpsr algorithm energy

来源：评论

学校读者我要写书评

暂无评论

Comparison and Analysis of Nonlinear algorithms for Compressed Sensing in MRI

Comparison and Analysis of Nonlinear Algorithms for Compress...

引用

32nd Annual International Conference of the IEEE Engineering-in-Medicine-and-Biology-Society (EMBC 10)

作者： Yu, Yeyang Hong, Mingjian Liu, Feng Wang, Hua Crozier, Stuart Univ Queensland Sch Informat Technol & Elect Engn Brisbane Qld Australia Chongqing Univ Sch Software Engn Chongqing 630044 Peoples R China

ISBN: (纸本)9781424441242

Compressed sensing (CS) theory has been recently applied in Magnetic Resonance Imaging (MRI) to accelerate the overall imaging process. In the CS implementation, various algorithms have been used to solve the nonlinear equation system for better image quality and reconstruction speed. However, there are no explicit criteria for an optimal CS algorithm selection in the practical MRI application. A systematic and comparative study of those commonly used algorithms is therefore essential for the implementation of CS in MRI. In this work, three typical algorithms, namely, the Gradient Projection For Sparse Reconstruction (gpsr) algorithm, Interior-point algorithm (l(1)_ls), and the Stagewise Orthogonal Matching Pursuit (StOMP) algorithm are compared and investigated in three different imaging scenarios, brain, angiogram and phantom imaging. The algorithms' performances are characterized in terms of image quality and reconstruction speed. The theoretical results show that the performance of the CS algorithms is case sensitive;overall, the StOMP algorithm offers the best solution in imaging quality, while the gpsr algorithm is the most efficient one among the three methods. In the next step, the algorithm performances and characteristics will be experimentally explored. It is hoped that this research will further support the applications of CS in MRI.

关键词： gpsr algorithm StOMP algorithm biomedical MRI biomedical MRI compressed sensing implementation data compression gradient projection for sparse reconstruction image quality image reconstruction image reconstruction speed interior-point algorithm iterative methods magnetic resonance imaging medical image processing nonlinear algorithms nonlinear equation system nonlinear equations stagewise orthogonal matching pursuit

来源：评论

学校读者我要写书评

暂无评论

ON THE DISCREPANCY OF GFSR PSEUDORANDOM NUMBERS

引用

JOURNAL OF THE ACM 1987年第4期34卷 939-949页

作者： TEZUKA, S IBM CORP TOKYO RES LABTOKYOJAPAN

A new summation formula based on the orthogonal property of Walsh functions is devised. Using this formula, the k-dimensional discrepancy of the generalized feedback shift register (GFSR) pseudorandom numbers is derived. The relation between the discrepancy and k-distribution of GFSR sequences is also obtained. Finally the definition of optimal gpsr pseudorandom number generators is introduced.

关键词： Discrepancy gpsr algorithm k-distribution M-sequences Walsh functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：