The design and implementation of network courseware of “algorithm design and analysis”

2015 ◽  
pp. 445-448
Keyword(s):  
Algorithm Design ◽  
Algorithm Design And Analysis ◽  
Design And Implementation

Algorithm Design and Implementation of Dynamic Star Simulator

2013 ◽  
Vol 722 ◽  
pp. 187-193
Author(s):  
Xiao Fang Zhao ◽  
Guang Bin Liu ◽  
Chao Shan Liu
Keyword(s):  
Traditional Method ◽  
Algorithm Design ◽  
Star Tracker ◽  
Simulation Algorithm ◽  
Arc Length ◽  
Visual Axis ◽  
Star Image ◽  
Design And Implementation ◽  
Simulation Testing ◽  
Celestial Sphere

In order to realize the simulation testing and calibration of star tracker in the lab, a simulation algorithm for dynamic and celestial sphere star image was proposed. This algorithm could complete simulation of star image at any time and any visual axis point, also could realize in-orbit simulation according to a given track. A new method of space district dividing was also presented in order to improve the traditional method of space district dividing by ascension and declination, fully considered declination arc length gradually shortened with latitude increasing. It can remarkably enhance the updating frequency simulation star image.

scholarly journals On partial sorting in restricted rounds

2017 ◽  
Vol 9 (1) ◽  
pp. 17-34
Author(s):  
Antal Iványi ◽  
Norbert Fogarasi
Keyword(s):  
Algorithm Design ◽  
Relative Strength ◽  
Worst Case ◽  
Algorithm Design And Analysis ◽  
Research Article ◽  
Case Number

AbstractLet n and k be integers such that n ≥ 2 and 1 ≤ k ≤n. In this paper, we consider the problem of finding an ordered list of the k best players out of n participants by organizing a tournament of rounds of pairwise matches (comparisons). Assuming that (i) in each match there is a winner (no ties) (ii) the relative strength of the players is constant throughout the tournament and (iii) the players’ strengths are transitive, the problem is equivalent to partially sorting n different, comparable objects, allowing parallelization in rounds. The rounds are restricted as one player can only play one match in each round. We propose concrete pairing algorithms and make conjectures about their performance in terms of the worst case number of rounds and matches required. The research article was started by professor Antal Iványi who sadly passed away during the work and was completed in his honor by the co-author. He hopes, in this modest way, to reflect his deep admiration for professor Iványi’s many contributions to the theory, practice and appreciation of algorithm design and analysis.

Sign in / Sign up

Export Citation Format

Share Document