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

NASA Technical Reports Server (Ntrs) 20150016024: a New Architecture for Extending the Capabilities of the Copernicus Trajectory Optimization Program

引用

2016年

NASA Technical Reports Server (Ntrs) 20150016024: a New Architecture for Extending the Capabilities of the Copernicus Trajectory Optimization Program by NASA Technical Reports Server (Ntrs); NASA Technical Reports Ser... 详细信息

关键词： (ntrs) 20150016024: applications programs (computers) architecture architecture (computers) capabilities computer programming copernicus fortran high level languages nasa space programs nasa technical reports server (ntrs) oao 3 parsing algorithms software engineering sorting algorithms spacecraft launching spacecraft trajectories trajectory optimization uk space program williams, jacob

来源：评论

学校读者我要写书评

暂无评论

Integrating Pareto Optimization into Dynamic Programming

引用

algorithms 2016年第1期9卷

作者： Gatter, Thomas Giegerich, Robert Saule, Cedric Univ Bielefeld Fac Technol D-33501 Bielefeld Germany Univ Bielefeld Ctr Biotechnol D-33501 Bielefeld Germany

Pareto optimization combines independent objectives by computing the Pareto front of the search space, yielding a set of optima where none scores better on all objectives than any other. Recently, it was shown that Pareto optimization seamlessly integrates with algebraic dynamic programming: when scoring schemes A and B can correctly evaluate the search space via dynamic programming, then so can Pareto optimization with respect to A and B. However, the integration of Pareto optimization into dynamic programming opens a wide range of algorithmic alternatives, which we study in substantial detail in this article, using real-world applications in biosequence analysis, a field where dynamic programming is ubiquitous. Our results are two-fold: (1) We introduce the operation of a Pareto algebra product in the dynamic programming framework of Bellman's GAP. Users of this framework can now ask for Pareto optimization with a single keystroke. Careful evaluation of the implementation alternatives by means of an extended Bellman's GAP compiler demonstrates the dependence of the best implementation choice on the application at hand. (2) We extract from our experiments several pieces of advice to programmers who do not use a system such as Bellman's GAP, but who choose to hand-craft their dynamic programming recurrences, incorporating Pareto optimization from scratch.

关键词： pareto optimization algebraic dynamic programming sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimized Selection Sort Algorithm for Two Dimensional Array 12

Optimized Selection Sort Algorithm for Two Dimensional Array

引用

12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Ullah, Sultan Khan, Muhammad A. Khan, Mudasser A. Akbar, H. Hassan, Syed S. Univ Haripur Dept Informat Technol Haripur Pakistan Univ Haripur Comp & Commun Res Lab Haripur Pakistan

ISBN: (纸本)9781467376822

The main idea of Optimized Selection Sort Algorithm (OSSA) is based on the already existing selection sort algorithm, with a difference that old selection sort;sorts one element either smallest or largest in a single iteration while optimized selection sort, sorts both the elements at the same time i.e smallest and largest in a single iteration. In this study we have developed a variation of OSSA for two-dimensional array and called it Optimized Selection Sort algorithms for Two-Dimensional arrays OSSA2D. The hypothetical and experimental analysis revealed that the implementation of the proposed algorithm is easy. The comparison shows that the performance of OSSA2D is better than OSSA by four times and when compared with old Selection Sort algorithm the performance is improved by eight times (i.e if OSSA can sort an array in 100 seconds, OSSA2D can sort it in 24.55 Seconds, and similarly if Selection Sort takes 100 Seconds then OSSA2D take only 12.22 Seconds). This performance is remarkable when the array size is very large. The experiential results also demonstrate that the proposed algorithm has much lower computational complexity than the one dimensional sorting algorithm when the array size is very large.

关键词： Algorithm analysis sorting algorithms Two Dimensional Arrays Computational Complexity

来源：评论

学校读者我要写书评

暂无评论

Study of test classification algorithm based on domain knowledge

Study of test classification algorithm based on domain knowl...

引用

Third International Conference on Cyberspace Technology (CCT 2015)

作者： Yutong Gao Feifan Song Xiaqing Xie Qing Sun Xu Wu Department of Computer Science and Information Engineering National Taipei University of Technology China School of Economics andManagement Beijing University of Posts and Telecommunications China Beijing University of Posts and Telecommunications Library China Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Ministry of Education Beijing China

When facing various and massive data resources, how to effectively utilize the resources according to the division field is one of the core problem of the institutional repository research. In this paper, we improved Bayesian classification algorithm, then proposed a text classification algorithm based on domain knowledge. Furthermore, some key technologies such as text classification, feature selection, weight improvement and domain knowledge algorithm improvement are designed and implemented. We use widely applied IkAnalyzer method to classify Chinese words. For feature selection and weight improvement part, we focus on the processing of special vocabulary in the document. We introduce the field expand vocabulary assist the Bayesian formula in the field application part to obtain the final result. The experiment result shows that the improved algorithm enhanced the accuracy of the classification efficiently, and the system calculating time is acceptable.

关键词： Bayesian Classification Domain Knowledge Institutional Repository sorting algorithms Text Classification domain knowledge Text categorization sorting algorithm Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Deadlock-Free Consecutive Task Assignment of Multiple Heterogeneous Unmanned Aerial Vehicles

引用

JOURNAL OF AIRCRAFT 2014年第2期51卷 596-605页

作者： Deng, Qibo Yu, Jianqiao Mei, Yuesong Beijing Inst Technol Sch Aerosp Engn Minist Educ Key Lab Dynam & Control Flight Vehicle Beijing 100081 Peoples R China Beijing Inst Technol Sch Aerosp Engn Beijing 100081 Peoples R China

This paper presents an integrated approach based on graph theory for solving the deadlock problem in the cooperative task assignment of multiple heterogeneous unmanned aerial vehicles, which is concerned with the cooperative decision making and control. Because of heterogeneity, one task cannot be performed by arbitrary vehicles in the heterogeneous group. A vehicle that performs multiple tasks on targets needs to change its path, waiting for others if another vehicle that executes a former or simultaneous task has not finished or arrived. This creates risks of deadlock. Two or more vehicles may fall into a situation of infinite waiting due to shared resources and precedence constraints among various tasks. In this work, a task-precedence graph of solutions is constructed and analyzed for detecting deadlocks. And transposing operations are used to unlock solutions that involved in deadlocks. In addition, the topological sort of tasks is used in the path elongation of vehicles. Thus, deadlock-free solutions are obtained, and the path coordination is done. Computational experiments are conducted to check the performance of the approach, and the results validate the effectiveness.

关键词： UAV Genetic Algorithm Motion Planning Computer Systems Mixed Integer Linear Programming Search Algorithm sorting algorithms Heading Angle MATLAB

来源：评论

学校读者我要写书评

暂无评论

Use of Randomized algorithms for Enhancing Learning Ability in algorithms Course

Use of Randomized Algorithms for Enhancing Learning Ability ...

引用

IEEE International Conference on MOOCs, Innovation and Technology in Education (IEEE MITE)

作者： Goyal, Puneet Dwivedi, Monika Awais, Mohd Graph Era Univ Dept Comp Sci & Engn Dehra Dun India

ISBN: (纸本)9781479968763

In the field of Computer Science and Engineering, the algorithms course is considered very important for not only it forms the basis for several concepts but also, its in-depth understanding can help one solve many new and challenging problems in an efficient manner. Whether a student pursues his career in academia or industry, depth of his understanding in algorithms is certainly tested during competitive exams directly or indirectly. In this paper, we discuss a case study of using an innovative approach based on randomized algorithms and some statistics in teaching algorithms to engineering students, with aim to provide students a better individual learning experience. The approach has wider applicability but here it is practiced in relation to sorting algorithms. In this paper, we also discuss the student's feedback that we collected after completion of the course. It was observed that students were very appreciative of this novel approach used, and the majority of students found that it helped them in getting more clarity and deeper understanding of sorting algorithms.

关键词： Enhanced learning survey randomized algorithms statistics sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimized Selection Sort Algorithm for Two Dimensional Array

Optimized Selection Sort Algorithm for Two Dimensional Array

引用

International Conference on Fuzzy Systems and Knowledge Discovery

作者： Sultan Ullah Muhammad A. Khan Mudasser A. Khan H. Akbar Syed S. Hassan Dept. of Inf. Technol. Univ. of Haripur Haripur Pakistan

ISBN: (纸本)9781467376839

关键词： Algorithm analysis sorting algorithms Two Dimensional Arrays Computational Complexity

来源：评论

学校读者我要写书评

暂无评论

Analysis of the Monotonic Lagrangian Grid as an Air Traffic Simulation Tool

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2013年第1期36卷 196-206页

作者： Kaplan, Carolyn Dahm, Johann Oran, Elaine Alexandrov, Natalia Boris, Jay USN Res Lab Labs Computat Phys & Fluid Dynam Lab Prop Energet & Dynam Syst Washington DC 20375 USA Univ Michigan Dept Aerosp Engn Ann Arbor MI 48109 USA USN Res Lab LCP & FD Washington DC 20375 USA NASA Langley Res Ctr NextGen Syst Anal Integrat & Evaluat Project Hampton VA 23681 USA

A new research platform, the Air Traffic Monotonic Lagrangian Grid, has been developed to serve as a simulation tool for easy and fast testing of various air traffic system concepts. The underlying algorithm is the Monotonic Lagrangian Grid, which is a fast nearest-neighbors interaction algorithm used for sorting and tracking many moving and interacting objects. The nodes of the Monotonic Lagrangian Grid represent the locations of individual aircraft, and the grid moves at each time step as the aircraft move. The model is used to simulate a 24 h period of air traffic flow in the National Airspace System, during which there are 41,594 flights, and this requires only 79 s of wall-clock time on a single processor of a 1.3 GHz Altix. An analysis is presented of the number of nearest-neighbor nodes that must be checked to ensure adequate separation among aircraft. An investigation of the effect of removing waypoints from aircraft trajectories indicates that this may result in a significant reduction in total flight time. Finally, the model is compared with the traditional Latitude - Longitude grid approach, in which the airspace volume is partitioned into fixed stationary grid cells. Results of the comparison indicate that the main advantage of the Monotonic Lagrangian Grid method is that it is a general sorting algorithm that can sort on multiple properties, providing more computational efficiency.

关键词： Enhanced Traffic Management System National Airspace System Airspace sorting algorithms Federal Aviation Administration Conflict Detection and Resolution Computer Memory Direct Simulation Monte Carlo Air Transportation System Cruise Altitude

来源：评论

学校读者我要写书评

暂无评论

Running time of the Treapsort algorithm

引用

THEORETICAL COMPUTER SCIENCE 2013年 487卷 65-73页

作者： Early, D. Schellekens, M. Natl Univ Ireland Univ Coll Cork Ctr Efficiency Oriented Languages Cork Ireland

We analyse the running time of Treapsort, a sorting algorithm in the MOQA(1) programming language, which acts on treaps. We show that, using the 'partial permutation' model of Banderier et al. (2003) [1], Treapsort has smoothed complexity Theta (sigma(-1)n ln n) for treaps of size n. We also show that the multiset of running times of Treapsort on all treaps of size n is equal to the multiset of running times of Quicksort on all lists of length n. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Average-case analysis of algorithms Smoothed complexity sorting algorithms MOQA

来源：评论

学校读者我要写书评

暂无评论

A tag feedback based sorting algorithm for social search

A tag feedback based sorting algorithm for social search

引用

2012 International Conference on Systems and Informatics, ICSAI 2012

作者： Jiang, Zongli Li, Jingsheng College of Computer Science and Technology Beijing University of Technology Beijing 100124 China

ISBN: (纸本)9781467301992

The social search use social ability to participate in the screening and sorting of search results in order to make the result to tend to reflect the hopes of the people better. Based on the prototype of social search, the concept of user tag feedback scores is employed. Based on this concept, a tag-based feedback web ranking algorithm is designed. The algorithm can efficiently use the user's feedback. Finally, a variety of evaluation methods are used to analyze the search results of different sort. The experiments show that the new sorting algorithm can meet the user's real needs better. © 2012 IEEE.

关键词： feedback labels social search sorting algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：