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

10th International Conference on Communications, Signal Processing, and Systems

作者： Li, Jiatong Li, Zhibo Li, Xuanying Wang, Cheng Tianjin Normal Univ Tianjin Key Lab Wireless Mobile Commun & Power Tr Tianjin 300387 Peoples R China Tianjin Normal Univ Coll Elect & Commun Engn Dept Commun Engn Tianjin 300387 Peoples R China Tianjin Normal Univ Coll Elect & Commun Engn Dept Elect Informat Sci & Technol Tianjin 300387 Peoples R China Tianjin Normal Univ Coll Artificial Intelligence Dept Intelligence Sci & Technol Tianjin 300387 Peoples R China

ISBN: (纸本)9789811903908;9789811903892

With the progress of science and technology, the development of wireless communication ushered in a key era of technological progress. Lower energy consumption and faster data rates have become the key factors for mobile phone users to have a good experience. The vigorous promotion of the Internet of Things has become the mainstream trend of future research and development direction. At present, the commercialization of the fifth-generation mobile communication system is gradually promoting the development of the Internet of Things. Due to the narrow signal radiation range of 5G technology, the deployment density of micro-base stations has to be increased. With the rapid increase of the number of information nodes, all the relay devices in the Internet of Things system are faced with the burden of excessive data traffic. In order to adjust the current data volume distribution service, this study draws on the application of ant colony algorithm and artificial immune algorithm in cellular network. By analyzing the characteristics of the two algorithms, this study proposes a D2D IoT routing optimization algorithm based on the fusion of ant colony algorithm and artificial immune algorithm. According to theoretical analysis and numerical simulation results, we believe that the improved routing algorithm has faster convergence speed and higher stability. At the same time, the channel transmission line can be updated in real time according to the transmission information of each node. Therefore, the optimization algorithm proposed in this paper can achieve more applications.

关键词： ACO AIA D2D routing Energy efficiency convergence algorithm

来源：评论

学校读者我要写书评

暂无评论

Generalized hesitant multiplicative preference relations and the analytic risk-network process

引用

INFORMATION SCIENCES 2020年 540卷 345-369页

作者： Liu, Man Zhou, Wei Duan, Yunlong Yunnan Univ Finance & Econ Business Sch Kunming 650221 Yunnan Peoples R China Sichuan Univ Business Sch Chengdu 610064 Peoples R China

The hesitant fuzzy preference relation (HFPR) and the hesitant multiplicative preference relation (HMPR) are emerging techniques in decision-making research field. Clearly, an intuitionistic idea to improve the above preference relations is to synthesize the HFPR and the HMPR, which is also a primary contribution of this paper. Based on which, we propose the generalized HMPR (GHMPR) with full desired properties using transformation formulas that combine HFPR with HMPR and convert the HMPR into the GHMPR. Then, the GHMPR not only considers different risk appetites of a decision maker, but also preserves the advantages of both. Moreover, we design the corresponding consistency check algorithms, weight calculation methods and convergence algorithms for the GHMPR. Based on these new methods, we further propose a qualitative decision-making method under the GHMPR environment named as the analytic risk-network process (ARNP). Saaty's well-known analytic network process case is then utilized as an illustrated example to verify the feasibility of the proposed methods via comparisons. The simulation results show our proposed methods are effective and useful. (c) 2020 Elsevier Inc. All rights reserved.

关键词： Generalized hesitant multiplicative preference relation Consistency check algorithm Weight calculation method convergence algorithm Analytic risk-network process

来源：评论

学校读者我要写书评

暂无评论

Irradiance distribution model for laser triangulation displacement sensor and parameter optimization

引用

OPTICAL ENGINEERING 2019年第9期58卷

作者： Yang, Hongwei Tao, Wei Liu, Kaimei Selami, Yassine Zhao, Hui Anhui Univ Technol Dept Elect Engn Maanshan Peoples R China Shanghai Jiao Tong Univ Dept Instrument & Engn Shanghai Peoples R China

An irradiance distribution model for laser triangulation displacement sensors is proposed, which is more suitable for practical applications than the geometric optical model (GOM). Based on the irradiance distribution model, a convergence algorithm is developed. Compared with the design parameter optimized method based on the GOM, the convergence algorithm can be used for optimization of not only the traditional design parameters including view angle and object distance but also the waist of the source laser beam. Additionally, using this convergence algorithm, the nonlinearity can be evaluated in the design stage. To validate the convergence algorithm, two example cases are performed. The results show that the nonlinearities are reduced to 6.3098 and 5.7946 mu m, respectively. (C) 2019 Society of Photo-Optical Instrumentation Engineers (SPIE)

关键词： laser triangulation displacement sensor parameter optimization irradiance distribution nonlinearity convergence algorithm

来源：评论

学校读者我要写书评

暂无评论

Investigation of the Stability and convergence of Difference Schemes for the Three-dimensional Equations of the Atmospheric Boundary Layer

引用

INTERNATIONAL JOURNAL OF ELECTRONICS AND TELECOMMUNICATIONS 2018年第3期64卷 391-396页

作者： Temirbekov, Almas N. Urmashev, Baydaulet A. Gromaszek, Konrad Al Farabi Kazakh Natl Univ Alma Ata Kazakhstan Lublin Univ Technol Lublin Poland

In this article we construct a finite-difference scheme for the three-dimensional equations of the atmospheric boundary layer. The solvability of the mathematical model is proved and quality properties of the solutions are studied. A priori estimates are derived for the solution of the differential equations. The mathematical questions of the difference schemes for the equations of the atmospheric boundary layer are studied. Nonlinear terms are approximated such that the integral term of the identity vanishes when it is scalar multiplied. This property of the difference scheme is formulated as a lemma. Main a priori estimates for the solution of the difference problem are derived. Approximation properties are investigated and the theorem of convergence of the difference solution to the solution of the differential problem is proved.

关键词： atmospheric boundary layer equations difference scheme approximation error stability convergence algorithm numerical solution

来源：评论

学校读者我要写书评

暂无评论

Making an ALARP Decision of Sufficient Testing

Making an ALARP Decision of Sufficient Testing

引用

15th IEEE International Symposium on High-Assurance Systems Engineering (HASE)

作者： Malekzadeh, Mahnaz Bate, Iain Malardalen Univ Malardalen Real Time Res Ctr Vasteras Sweden Univ York Dept Comp Sci York YO10 5DD N Yorkshire England

ISBN: (纸本)9781479934652

ALARP is an important concept in many safety standards. It helps in making a decision about how tolerable a risk is. A tolerable risk should be reduced to a point that is As Low As Reasonably Practicable (ALARP) which implies further risk-reduction is grossly inappropriate compared to the benefit attained. To date work has considered the process, safety arguments, and influencing factors of how to make an ALARP decision but not shown how to make a quantified judgement for it. In this paper a method for making an ALARP judgement decision is proposed in the context of testing the worst-case timing properties of systems. The method is based around a convergence algorithm that informs the tester when it is believed that testing for longer will not reveal sufficiently important new findings, i.e. any significant increase in observed worst-case timing needs a disproportionate amount of testing time.

关键词： decision making program testing risk analysis safety-critical software ALARP judgement decision making as low as reasonably practicable convergence algorithm risk-reduction safety arguments safety standards safety-critical systems sufficient testing tolerable risk worst-case timing property testing algorithm design and analysis convergence Probabilistic logic Safety Testing Time factors Timing ALARP Real-time systems Safety Testing

来源：评论

学校读者我要写书评

暂无评论

Contention Overhead - Adaptive Binary Priority Countdown Protocol

Contention Overhead - Adaptive Binary Priority Countdown Pro...

引用

21st International Conference on Software, Telecommunications and Computer Networks (SoftCOM)

作者： Kedzo, Ivan Ozegovic, Julije Kristic, Ante Univ Split Univ Dept Profess Studies Split Croatia Univ Split Fac Elect Engn Mech Engn & Naval Architecture Split Croatia

ISBN: (纸本)9789532900439

Recently, a binary contention protocol, called Binary Priority Countdown, BPC, was introduced. The BPC has the ability to manage the priority space without the need to change the length of the binary countdown round giving it optimization and adaptation capabilities. In this paper, a new protocol called Contention Overhead - Adaptive Binary Priority Countdown protocol, CO-ABPC, is introduced. The CO-ABPC protocol is based on the BPC protocol but it uses a new adaptation mechanism. This mechanism observes the length of the contention resolution period in order to determine the common optimal priority space, similar to Idle Sense protocol. Also, in order to control the collision memory and countdown effects, the protocol is enhanced with collision memory avoidance algorithm CPCF proposed earlier. Both of these enhancements have been verified through simulations, confirming higher throughput results in various network scenarios.

关键词： wireless MAC binary countdown collision memory convergence algorithm AIMD Idle Sense

来源：评论

学校读者我要写书评

暂无评论

An algorithm of wavelet network learning from noisy data

An algorithm of wavelet network learning from noisy data

引用

6th World Congress on Intelligent Control and Automation

作者： Zhang, Zhiguo San, Ye Harbin Inst Technol Control & Simulat Ctr Harbin 150001 Peoples R China

ISBN: (纸本)1424403316

Noise often leads to bad generalization of network. Many of the typical algorithms can not be applied for the on-line identification of complex system since they are not robust to the variance of the energy of noise. A new algorithm is proposed to solve this problem based on the frequency band of wavelet network. It is shown that the wavelet network trained by the new algorithm is a low-pass filter, which has removed the noise out the frequency band of network. Since the frequency band of noise is usually higher than that of network, the variance of noise little influences the identification of wavelet network so the new algorithm is robust to the variance of noise. The analysis of theory and the results of simulation show that the new algorithm has the capacity of avoidance of overfitting and the robustness of noise.

关键词： convergence algorithm overfitting removal of noise

来源：评论

学校读者我要写书评

暂无评论

An adaptive and aggressively bounded convergence algorithm for enhancing and measuring the performance of applications running on networks with heavy-tailed distributions 15

An adaptive and aggressively bounded convergence algorithm f...

引用

15th International Parallel and Distributed Processing Symposium, IPDPS 2001

作者： Wong, J.H.C. Ip, M.T.W. Wong, A.K.Y. Department of Computing Hong Kong Polytechnic University Hunghom Kowloon Hong Kong

ISBN: (纸本)0769509908

The proposed convergence algorithm quickly and accurately predicts the mean response times of Internet channels operating with request-response type of communication protocols. At first, how the convergence algorithm was verified and validated in our previous work will be concisely described. A previous time-out message transmission model has been devised using the validated algorithm as a tool to control message transmission and re-transmission in networks with heavy tailed distributions. First, the shortcomings of our previous time-out message transmission model and its effects on the resulting response time of an application will be presented. Second, a new hybrid model will be proposed in this paper to address the shortcomings. © 2001 IEEE.

关键词： aggressive message transmission convergence algorithm end-to-end approach heavy tailed distribution message response time message retransmission time-out window

来源：评论

学校读者我要写书评

暂无评论

A convergence algorithm for enhancing the performance of distributed applications running on sizeable networks

引用

COMPUTER SYSTEMS SCIENCE AND ENGINEERING 2001年第4期16卷 229-236页

作者： Wong, AKY Wong, JHC Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China

The proposed convergence algorithm is aimed at enhancing the performance of distributed applications running on sizeable networks exemplified by the Internet. The aim is achieved by quickly and accurately predicting the mean message response time of a communication channel with only end-to-end consideration. With the predicted mean the correct window size of the desired coverage of time-out tolerance for message transmission and response can be computed. The correct window size contributes to reduce excessive message retransmissions caused by time-outs. The proposed algorithm is particularly useful in helping time-critical distributed applications deliver their correct functions because prolonged delays in message response in these applications can lead to fatal errors. The discussion in this paper is focused mainly on the development of the convergence algorithm. Results from experiments have concluded that the proposed algorithm is indeed an effective solution for the stated aim. The simplicity of the algorithm is an advantage because it makes its implementation in real systems easy.

关键词： communication channel mean message response time convergence algorithm Central Limit Theorem and flush limit

来源：评论

学校读者我要写书评

暂无评论

A new approach towards analyzing multiagent behaviour via the game of go

A new approach towards analyzing multiagent behaviour via th...

引用

Conference on Convergent Technologies for the Asia-Pacific Region (TENCON 2003)

作者： Bhattacharya, S Banerjee, A Bandyopadhyay, S Jadavpur Univ Dept Comp Sci & Engn Kolkata 700032 W Bengal India

ISBN: (纸本)0780381629

Go is two-player board game that poses one of the largest challenges to game programmers today. Multiagent systems are those composed of multiple autonomous, interacting computer systems, or agents. These two seemingly diverse areas have a number of similarities, which will be explored here. In this paper an attempt has been made to discuss possible solution strategies for this problem as well as the metrics used to define convergence towards a favourable direction.

关键词： multiagents simulation convergence metric convergence algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：