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

2013 International Conference on Advanced information Engineering and Education Science, ICAIEES 2013

作者： Chang, Jing Li, Xiaohui Key Laboratory of Intelligent Computing and Singnal Processing School of Electronic Information Engineering Anhui University Anhui Province China

ISBN: (纸本)9789078677949

This paper applies Matlab software as an auxiliary method in teaching course of communication principle. Considering variety of abstract concepts in this course, such as digital modulation and demodulation, channel-coding, random signal analysis, we select Matlab aid to provide dynamical simulation for communication theory. This method is used both in class presentation and laboratory experiments, which is helpful for students to understand the theory knowledge, enhancing their practical skills. Moreover, it can also extend students' ability of programming. Compared to traditional teaching method, the teacher's interpretation written on blackboard is the main means, this method enables students to study actively and cultivate their scientific qualities. © 2013. The authors - Published by Atlantis Press..

关键词： Simulink

来源：评论

学校读者我要写书评

暂无评论

A Short Flows Fast Transmission Algorithm Based on MPTCP Congestion Control 6th

A Short Flows Fast Transmission Algorithm Based on MPTCP Con...

引用

6th International Conference on Artificial Intelligence and Security, ICAIS 2020

作者： Zhong, Hua Dong, PingPing Tang, WenSheng Yang, Bo Xie, JingYun Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China

ISBN: (纸本)9783030578831

With the development of cloud computing and big data technology, traffic in the network presents new features. Real-time online interactive applications are increasing, mainly including web services, instant messaging, online commerce, advertising systems. They have very stringent latency requirements. However, the data traffic generated by data backup, movie download, data mining require high bandwidth. When large and small flows are transmitted concurrently, a series of problems will arise. MPTCP treats long and short flows equally. In this way, packets of long flows will preempt bandwidth at the bottleneck link, fill the router’s whole queue buffer. This will cause the short flows transmission timeout. To solve these problems, we propose a novel algorithm named MPTCP-SPTA (MPTCP short flows fast transmission algorithm). The algorithm give high priority to short flows based on the congestion control algorithm, then introduce the Explicit Congestion Notification mechanism(ECN) in MPTCP. Through extensive network simulator (NS-3) simulations, we demonstrate that MPTCP-SPTA outperforms TCP and MPTCP in three typical network topology, which can significantly reduce the completion time of the small flow and effectively improving the total throughput of the network. © 2020, Springer Nature Switzerland AG.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

DRLO: Optimizing edge server placement in dynamic MEC scenarios using deep reinforcement learning

引用

Computer Networks 2025年 268卷

作者： Yingya Guo Cen Chen College of Computer and Data Science Fuzhou University PR China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University PR China Engineering Research Center of Big Data Intelligence Ministry of Education Fujian PR China

As an emerging computing paradigm, Mobile Edge computing (MEC) significantly enhances user experience and alleviates network congestion by strategically deploying edge servers in close proximity to mobile users. However, the effectiveness of MEC hinges on the precise placement of these edge servers, a critical factor in determining the Quality of Experience (QoE) for mobile users. While existing studies predominantly focus on optimizing edge server placement in static scenarios, they often fall short when faced with user mobility, resulting in a degradation of QoE. To address this challenge, we propose an adaptive edge server placement approach that leverages Deep Reinforcement Learning (DRL) to select the base stations for placing edge servers in a dynamic MEC environment. Our objective is to minimize access delay by optimizing edge server placement for adapting to dynamic environment. To tackle the vast action space associated with edge server placement, we introduce a novel activation function in the actor neural network for efficient exploration. Furthermore, to enhance the adaptability of the derived edge server placement strategy, we meticulously design a new reward function, which takes into account the minimization of total access delay within dynamic MEC scenarios. Finally, to validate the effectiveness of our proposed method, extensive experiments were conducted using the Shanghai Telecom dataset. The results demonstrate that our approach outperforms baseline methods in minimizing access delay for users in dynamic MEC scenarios.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Efficient Multi-objective Approach Based on Golden Jackal Search for Dynamic Economic Emission Dispatch

引用

Journal of Bionic Engineering 2024年第3期21卷 1541-1566页

作者： keyu Zhong Fen Xiao Xieping Gao Key Laboratory of Computing and Stochastic Mathematics of Ministry of Education Hunan Normal UniversityChangsha410081China School of Mathematics and Statistics Hunan Normal UniversityChangsha410081China School of Computer Science Xiangtan UniversityXiangtan411105China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha410081China

Dynamic Economic Emission Dispatch(DEED)aims to optimize control over fuel cost and pollution emission,two conflicting objectives,by scheduling the output power of various units at specific *** many methods well-performed on the DEED problem,most of them fail to achieve expected results in practice due to a lack of effective trade-off mechanisms between the convergence and diversity of non-dominated optimal dispatching *** address this issue,a new multi-objective solver called Multi-Objective Golden Jackal Optimization(MOGJO)algorithm is proposed to cope with the DEED *** proposed algorithm first stores non-dominated optimal solutions found so far into an ***,it chooses the best dispatching solution from the archive as the leader through a selection mechanism designed based on elite selection strategy and Euclidean distance index *** mechanism can guide the algorithm to search for better dispatching solutions in the direction of reducing fuel costs and pollutant ***,the basic golden jackal optimization algorithm has the drawback of insufficient search,which hinders its ability to effectively discover more Pareto *** this end,a non-linear control parameter based on the cosine function is introduced to enhance global exploration of the dispatching space,thus improving the efficiency of finding the optimal dispatching *** proposed MOGJO is evaluated on the latest CEC benchmark test functions,and its superiority over the state-of-the-art multi-objective optimizers is highlighted by performance ***,empirical results on 5-unit,10-unit,IEEE 30-bus,and 30-unit systems show that the MOGJO can provide competitive compromise scheduling solutions compared to published DEED ***,in the analysis of the Pareto dominance relationship and the Euclidean distance index,the optimal dispatching solutions provided by MOGJO are the closest to the ideal solutions for minimizing fuel costs

关键词： Dynamic economic emission dispatch Multi-objective optimization Golden jackal Euclidean distance index

来源：评论

学校读者我要写书评

暂无评论

APFA:Ameliorated Pathfinder Algorithm for Engineering Applications

引用

Journal of Bionic Engineering 2024年第3期21卷 1592-1616页

Pathfinder algorithm(PFA)is a swarm intelligent optimization algorithm inspired by the collective activity behavior of swarm animals,imitating the leader in the population to guide followers in finding the best food *** algorithm has the characteristics of a simple structure and high ***,PFA faces challenges such as insufficient population diversity and susceptibility to local optima due to its inability to effectively balance the exploration and exploitation *** paper proposes an Ameliorated Pathfinder Algorithm called APFA to solve complex engineering optimization ***,a guidance mechanism based on multiple elite individuals is presented to enhance the global search capability of the ***,to improve the exploration efficiency of the algorithm,the Logistic chaos mapping is introduced to help the algorithm find more high-quality potential solutions while avoiding the worst ***,a comprehensive following strategy is designed to avoid the algorithm falling into local optima and further improve the convergence *** three strategies achieve an effective balance between exploration and exploitation overall,thus improving the optimization performance of the *** performance evaluation,APFA is validated by the CEC2022 benchmark test set and five engineering optimization problems,and compared with the state-of-the-art metaheuristic *** numerical experimental results demonstrated the superiority of APFA.

关键词： Pathfinder algorithm Swarm intelligent Metaheuristic Engineering problems

来源：评论

学校读者我要写书评

暂无评论

Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per Edge 14th

Parameterized Algorithms for Fixed-Order Book Drawing with B...

引用

14th International Conference on Combinatorial Optimization and Applications, COCOA 2020

作者： Liu, Yunlong Chen, Jie Huang, Jingui Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China

ISBN: (纸本)9783030648428

Given a graph G= (V, E) and a fixed linear order of V, the problem fixed-order book drawing with bounded number of crossings per edge asks whether there is a k-page book drawing of G such that the maximum number of crossings per edge is upper-bounded by an integer b. This problem was posed by Bhore et al. (GD 2019;J. Graph Algorithms Appl. 2020) and thought to be interesting for further investigation. In this paper, we study the fixed-parameter tractable algorithms for this problem. More precisely, we show that this problem parameterized by both the bounded number b of crossings per edge and the vertex cover number τ of the graph admits an algorithm running in time (b+2)O(τ3)·|V|, and this problem parameterized by both the bounded number b of crossings per edge and the pathwidth κ of the vertex ordering admits an algorithm running in time (b+2)O(κ2)·|V|. Our results provide a specifical answer to Bhore et al.’s question. © 2020, Springer Nature Switzerland AG.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

GTK:A Hybrid-Search Algorithm of Top-Rank-k Frequent Patterns Based on Greedy Strategy

引用

Computers, Materials & Continua 2020年第6期63卷 1445-1469页

作者： Yuhang Long Wensheng Tang Bo Yang Xinyu Wang Hua Ma Hang Shi Xueyu Cheng Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal UniversityChangsha410081China College of Information Science and Engineering Hunan UniversityChangsha410082China Clayton State University MorrowGA 30260USA

Currently,the top-rank-k has been widely applied to mine frequent patterns with a rank not exceeding *** the existing algorithms,although a level-wise-search could fully mine the target patterns,it usually leads to the delay of high rank patterns generation,resulting in the slow growth of the support threshold and the mining *** at this problem,a greedy-strategy-based top-rank-k frequent patterns hybrid mining algorithm(GTK)is proposed in this *** this algorithm,top-rank-k patterns are stored in a static doubly linked list called RSL,and the patterns are divided into short patterns and long *** short patterns generated by a rank-first-search always joins the two patterns of the highest rank in RSL that have not yet been *** the basis of the short patterns satisfying specific conditions,the long patterns are extracted through *** reduce redundancy,GTK improves the generation method of subsume index and designs the new pruning strategies of *** algorithm also takes the use of reasonable pruning strategies to reduce the amount of computation to improve the computational *** datasets and synthetic datasets are adopted in experiments to evaluate the proposed *** experimental results show the obvious advantages in both time efficiency and space efficiency of GTK.

关键词： Top-rank-k frequent patterns greedy strategy hybrid-search

来源：评论

学校读者我要写书评

暂无评论

Casict-dcu participation in wmt2015 metrics task 10

Casict-dcu participation in wmt2015 metrics task

引用

10th Workshop on Statistical Machine Translation, WMT 2015 at the 2015 Conference on Empirical Methods in Natural Language processing, EMNLP 2015

作者： Yu, Hui Ma, Qingsong Wu, Xiaofeng Liu, Qun Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Adapt Centre School of Computing Dublin City University

ISBN: (纸本)9781941643327

Human-designed sub-structures are required by most of the syntax-based machine translation evaluation metrics. In this paper, we propose a novel evaluation metric based on dependency parsing model, which does not need this human involvement. Experimental results show that the new single metric gets better correlation than METEOR on system level and is comparable with it on sentence level. To introduce more information, we combine the new metric with many other metrics. The combined metric obtains state-of-theart performance on both system level evaluation and sentence level evaluation on WMT 2014. © EMNLP 2015. All rights reserved.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Novel Retinex algorithm by interpolation and adaptive noise suppression

引用

Journal of Central South University 2012年第9期19卷 2541-2547页

作者：李武劲古博黄江涛王明辉 College of Computer Science Sichuan University College of Computer and Information Engineering Guangxi Teachers Education University Key Laboratory of Scientific Computing and Intelligent Information Processing of Guangxi Province (Guangxi University)

In order to improve image quality, a novel Retinex algorithm for image enhancement was presented. Different from conventional algorithms, it was based on certain defined points containing the illumination information in the intensity image to estimate the illumination. After locating the points, the whole illumination image was computed by an interpolation technique. When attempting to recover the reflectance image, an adaptive method which can be considered as an optimization problem was employed to suppress noise in dark environments and keep details in other areas. For color images, it was taken in the band of each channel separately. Experimental results demonstrate that the proposed algorithm is superior to the traditional Retinex algorithms in image entropy.

关键词： Retinex algorithm illumination estimation interpolation adaptive noise suppression

来源：评论

学校读者我要写书评

暂无评论

An Accurate Visual Navigation Method for Wheeled Robot in Unstructured Outdoor Environment Based on Virtual Navigation Line

An Accurate Visual Navigation Method for Wheeled Robot in Un...

引用

International Conference on Image, Vision and intelligent Systems, ICIVIS 2021

作者： Liang, Zhen Fang, Tiyu Dong, Zihao Li, Jinping School of Information Science and Engineering Jinan250022 China Shandong Provincial Key Laboratory of Network-Based Intelligent Computing Jinan250022 China Shandong College and University Key Laboratory of Information Processing and Cognitive Computing in 13th Five-Year Jinan250022 China

ISBN: (纸本)9789811669620

For the navigation problem in unstructured outdoor environment such as the field without artificial marks, a precise vision navigation method for wheeled robot based on virtual navigation line is proposed. Virtual navigation line is a virtual line based on a small amount of visual information, which can be used in many complex environments. Firstly, the robot needs to design the shape of the walking route. And the general robot’s walking routes can be divided into linear route and curve route. Secondly, different virtual navigation line strategies are generated for different walking routes. In the linear navigation part, the virtual navigation line is determined according to the tracking target and the reference target generated. In the curve navigation part, the curve virtual navigation line is fitted according to the multiple targets. Then, the virtual calibration line is determined based on the camera pitch angle, field of view (FOV) and the horizon position in the image, the offset angle and offset distance are computed by using the geometric relationship between virtual calibration line and virtual navigation line. Finally, the fuzzy PID control method is applied to correct robot's direction. The Pioneer3-DX robot is used to do experiments in the outdoor field. The results show that our method can make the robot walk along the designed route in the unstructured outdoor environment accurately, and the navigation accuracy is within 10 cm. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Navigation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：