This paper describes the results from using four counting methods that represented three different counting approaches – i.e., whole counting, straight counting, and fractional counting, on university rankings based on Hindex. Using a large bibliometric dataset that contained 20 years of physics research papers and citations from Web of Science, we tested the methods on the data and sorted 299 ...

(USA), are the only global university performance tables to judge world-class universities across all of their core mis-sions—teaching, research, knowledge transfer and international status. The top university rankings employ 13 carefully calibrated performance indicators to provide the most comprehensive and balanced comparisons available, which are trusted by students, academics, university l...

Any formulation of the university ranking game involves the perspectives of the 3 key actors: (1) graduating high-school students, (2) universities, and (3) ranking publications. These university rankings are developed and maintained by for-profit publications or magazines, which must balance 2 potentially conflicting motives: (1) to provide students with information to help them decide which u...

The general setting of this work is the constraint-based synthesis of termination arguments. We consider a restricted class of programs called lasso programs. The termination argument for a lasso program is a pair of a ranking function and an invariant. We present the— to the best of our knowledge—first method to synthesize termination arguments for lasso programs that uses linear arithmetic. W...

Different approaches have been explored in the past to solve fuzzy transportation or shipping problems. The cost of shipping, supply, and demand quantities are all ambiguous a dilemma. Trapezoidal numbers used represent parameters this situation. can be converted into crisp using variety ranking techniques. In paper, we've studied many techniques provided comparison two them. A numerical exampl...

We describe a new approach to proving termination with size change graphs. This is the first decision procedure for size change termination (SCT) which makes direct use of global ranking functions. It handles a well-defined and significant subset of SCT instances, designed to be amenable to a SAT-based solution. We have implemented the approach using a state-of-the-art Boolean satisfaction solv...

We study generalization properties of ranking algorithms in the setting of the k-partite ranking problem. In the k-partite ranking problem, one is given examples of instances labeled with one of k ordered ‘ratings’, and the goal is to learn from these examples a real-valued ranking function that ranks instances in accordance with their ratings. This form of ranking problem arises naturally in a...