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

Path Generation Method of UAV Autopilots Using max-min algorithm

JOURNAL OF INFORMATION PROCESSING SYSTEMS 2018年第6期14卷 1457-1463页

作者： Kwak, Jeonghoon Sung, Yunsick Dongguk Univ Dept Superintelligence Lab Seoul South Korea Dongguk Univ Dept Multimedia Engn Seoul South Korea

In recent times, Natural User Interface/Natural User Experience (NUI/NUX) technology has found widespread application across a diverse range of fields and is also utilized for controlling unmanned aerial vehicles (UAVs). Even if the user controls the UAV by utilizing the NUI/NUX technology, it is difficult for the user to easily control the UAV. The user needs an autopilot to easily control the UAV. The user needs a flight path to use the autopilot. The user sets the flight path based on the waypoints. UAVs normally fly straight from one waypoint to another. However, if flight between two waypoints is in a straight line, UAVs may collide with obstacles. In order to solve collision problems, flight records can be utilized to adjust the generated path taking the locations of the obstacles into consideration. This paper proposes a natural path generation method between waypoints based on flight records collected through UAVs flown by users. Bayesian probability is utilized to select paths most similar to the flight records to connect two waypoints. These paths are generated by selection of the center path corresponding to the highest Bayesian probability. While the K-means algorithm-based straight-line method generated paths that led to UAV collisions, the proposed method generates paths that allow UAVs to avoid obstacles.

关键词： Autopilot max-min algorithm Path Generation Unmanned Aerial Vehicle

来源：评论

学校读者我要写书评

暂无评论

A max-min algorithm for an On-line DDC System

引用

IFAC Proceedings Volumes 1985年第11期18卷 417-421页

作者： Su Shi-Quan Northeast University of Technology Shenyang Liaoning People's Republic of China

The positioning control system should carry out the follow-ing objectives, which are that the controlled machine must have the ability to accurately stall at high speed and possess no overshoot transient processes. These requirements are in conflict with one another in some cases. The solution of the max-min performance index problem, in which both weighting matrices Q and control parameter U are used to the system activity, can achieve the above objectives. Simulation experiments illustrate the validity of the method.

关键词： On-line DDC system max-min algorithm Quadratic cost function Accurate stalling Quadratic weight value determination

来源：评论

学校读者我要写书评

暂无评论

A New Modified max-min Workflow Scheduling algorithm for Cloud Environment 15

A New Modified Max-min Workflow Scheduling Algorithm for Clo...

引用

15th International Conference on Electronics, Computer and Computation (ICECCO)

作者： Auna, Shuaibu Yau Ambursa, Faruku Umar Ibrahim, Abdulhakeem Bayero Univ Kano Fac Comp Sci & Informat Technol Dept Comp Sci Kano Nigeria Bayero Univ Kano Fac Comp Sci & Informat Technol Dept Informat Technol Kano Nigeria Fed Univ Fac Sci Dept Comp Sci Birnin Kebbi Nigeria

ISBN: (纸本)9781728151601

In cloud computing, Service rendering is achieved through virtualization and the use of very large scalable resources where users access services by paying for the share of resources used by them. Several workflow scheduling techniques have been proposed for efficient scheduling. max-min approach is prominent among them, its features includes efficiency and the ability to guarantee optimal or near optimal solution because of its heuristic nature. Several enhancement to its functionalities have been proposed in the literature and works are still ongoing for improving it. This paper proposed a solution by minimizing total execution time where workflow tasks length are invariably considered before proper scheduling. Our proposed work is compared with standard max-min scheduling scheme. The proposed scheme outperforms the standard scheme;two realistic scientific workflows were used as test data for the simulation.

关键词： Cloud Computing Workflow Scheduling Heuristic algorithms max-min algorithm

来源：评论

学校读者我要写书评

暂无评论

min-max VS max-min FLOW-CONTROL algorithmS FOR OPTIMAL COMPUTER NETWORK CAPACITY ASSIGNMENT

引用

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 1984年第2期11卷 209-224页

作者： NIZNIK, CA UNIV ROCHESTER SCH MEDCTR BRAIN RESROCHESTERNY 14627

The theory for optimally assigning capacities to the links of a store forward computer communication network is developed by the minimization of the maximum of two groupings of all link capacities previously assigned to the network. The min-max and max-min algorithms developed have both local and global properties. The basic mathematical structure of the local section of the min-max algorithm is derived from the Lagrange Multiplier technique for minimizing convex functions, or the Kuhn-Tucker method for constrained minimization solutions, and the constraints imposed by the functional structure definitions. Since the min-max algorithm attains the optimal minimized delay assignment by minimization of the min-max assignment, the aspects of its relation to the max-min algorithms, the min-max inequality and the of both algorithms offers an option for considering all possible, allowed link assignment combinations (2 n - 2) of the n capacities available to further minimize delay.

关键词： min-max algorithm max-min algorithm Lagrange multiplier von Neumann minimax theorem capacity topology congestion convex function concave function Kuhn-Tucker method

来源：评论

学校读者我要写书评

暂无评论

AN ANALYSIS OF THE max-min APPROACH TO FEATURE-SELECTION AND ORDERING

引用

PATTERN RECOGNITION LETTERS 1993年第11期14卷 841-847页

作者： PUDIL, P NOVOVICOVA, J CHOAKJARERNWANIT, N KITTLER, J CZECHOSLOVAK ACAD SCI INST INFORMAT THEORY & AUTOMAT CS-18208 PRAGUE 8 CZECHOSLOVAKIA

The causes of deficiency of the max-min approach to feature selection are investigated. It is shown that the theoretical premise providing the basis for the max-min algorithm is not necessarily valid. A condition unde... 详细信息

关键词： FEATURE SELECTION FEATURE ORDERING max-min algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimization of Tasks in Cloud Computing Based on max-min, min-min and Priority 4

Optimization of Tasks in Cloud Computing Based on MAX-MIN, M...

引用

4th International Conference on Web Research (ICWR)

作者： Derakhshan, Majid Bateni, Zohreh Univ Sci & Culture Comp Engn Tehran Iran

ISBN: (纸本)9781538653647

Considering the growing use of cloud computing and the need for optimal use of resources in the cloud, and attention to users that pay for services they use based on their pay-as-you-go basis, There should be a quicker way for users to decrease the user's waiting time and task's waiting time. The main purpose of this paper is to provide an optimal algorithm using the advantages of the two traditional min-min and max-min algorithms. The other point that follow in this algorithm (TOMMP) is the priority of the tasks. There are a lot of scheduling algorithms in the world today, but the priority given to the tasks has been neglected and overlooked in most algorithms. In this algorithm, priority is firstly selected for tasks based on a prioritization algorithm, and then using the median number to decide which one of the min-min or max-min algorithms is to be used. It should be noted that according to the TOMMP algorithms, its waiting time is lower than comparisons of the compared algorithms and is shown to be better than the comparable algorithms.

关键词： TOMMP algorithm optimal scheduling algorithm scheduling algorithm cloud scheduling algorithm min-min algorithm max-min algorithm cloud computing

来源：评论

学校读者我要写书评

暂无评论

IMPROVED max-min HEURISTIC MODEL FOR TASK SCHEDULING IN CLOUD

IMPROVED MAX-MIN HEURISTIC MODEL FOR TASK SCHEDULING IN CLOU...

引用

International Conference on Green Computing, Communication and Conservation of Energy (ICGCE)

作者： Devipriya, S. Ramesh, C. Bannari Amman Inst Technol Sathyamangalam India

ISBN: (纸本)9781467361255

Cloud computing is the use of computing resources that are delivered as a service over a network. It supplies a high performance computing based on protocols which allows shared computation and storage over long distances. In cloud computing, many tasks need to execute at a time by the available resources in order to achieve better performance, minimum completion time, shortest response time, resource utilization etc [4]. Because of these different factors, we need to design, develop, and propose a scheduling algorithm for the proper allocation of tasks to the resources. In this paper, a simple modification of max-min algorithm is proposed. This algorithm is built based on RASA algorithm and the concept of max-min strategy. An Improved max-min algorithm is developed to outperform scheduling process of RASA in case of total complete time for all submitted jobs. Proposed max-min algorithm is based on expected execution time instead of complete time. So the scheduling tasks within cloud environment using Improved max-min can achieve lower makespan rather than original max-min.

关键词： Cloud computing max-min algorithm min-min RASA algorithm makespan

来源：评论

学校读者我要写书评

暂无评论

Geodesical Codebook Design for Precoded MIMO Systems

引用

IEEE COMMUNICATIONS LETTERS 2009年第10期13卷 773-775页

作者： Schober, K. Janis, P. Wichman, R. Aalto Univ FIN-02015 Helsinki Finland

We propose a numerical method for finding packings of multiple-input and multiple-output (MIMO) semi-unitary precoding matrices in Grassmannian manifolds with different metrics. The proposed expansion-compression algorithm (ECA) is practical, simple and produces efficient packings without the need for a sophisticated initialization. With chordal distance metric, the algorithm tends to converge into a degenerated point constellation, where two points contain identical as well as orthogonal columns and distance between them cannot increase further along geodesic. Therefore, we alternate between max-min and min-max clustering parts of ECA algorithm, where the latter prevents degenerated constellations. With Fubini-Study distance metric, the algorithm converges to best known packings without extra min-max processing.

关键词： Codebook design max-min algorithm geodesic Grassmannian subspace packing MIMO multi-antenna systems

来源：评论

学校读者我要写书评

暂无评论

Task-scheduling algorithm based on Improved Genetic algorithm in Cloud Computing Environment

引用

RECENT ADVANCES IN ELECTRICAL & ELECTRONIC ENGINEERING 2021年第1期14卷 13-19页

作者： Weiqing, G. E. Cui, Yanru Univ Technol City Coll Dongguan Dongguan Guangdong Peoples R China

Background: min-min and max-min algorithms were combined on the basis of the traditional genetic algorithm to make up for its shortcomings. Methods: In this paper, a new cloud computing task-scheduling algorithm that introduces min-min and max-min algorithms to generate initialization population, selects task completion time and load balancing as double fitness functions, and improves the quality of initialization population, algorithm searchability and convergence speed, was proposed. Results: The simulation results proved that the cloud computing task-scheduling algorithm was superior to and more effective than the traditional genetic algorithm. Conclusion: The paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.

关键词： Cloud computing genetic algorithm task scheduling min-min algorithm max-min algorithm EIGA scheduling

来源：评论

学校读者我要写书评

暂无评论

max-minimum algorithm for Trust Transitivity in Trustworthy Networks

Max-Minimum Algorithm for Trust Transitivity in Trustworthy ...

引用

IEEE/WIC/ACM International Conferences on Web Intelligence (WI)/Intelligent Agent Technologies (IAT),

作者： Chen, Yixiang Bu, Tian-ming Zhang, min Zhu, Hong E China Normal Univ Shanghai Key Lab Trustworthy Comp Shanghai 200062 Peoples R China

ISBN: (纸本)9781424453313

In this paper, we present a new measuring method of computing the transitive trustworthy degree between two different nodes. In this measuring method, the transitive trust degree of u and v along a path is measured in terms of the minimum weight of all edges on the path. For parallel paths between u and v, the transitive trust degree is defined as the maximum among the transitive degrees of all these paths. We prove that the measuring method can be done in polynomial time.

关键词： trustworthy degree max-min algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：