Merging and ranking answers in the semantic web:the wisdom of crowds

In this paper we propose algorithms for combining and ranking answers from distributed heterogeneous data sources in the context of a multi-ontology Question Answering task. Our proposal includes a merging algorithm that aggregates, combines and filters ontology-based search results and three different ranking algorithms that sort the final answers according to different criteria such as popularity, confidence and semantic interpretation of results. An experimental evaluation on a large scale corpus indicates improvements in the quality of the search results with respect to a scenario where the merging and ranking algorithms were not applied. These collective methods for merging and ranking allow to answer questions that are distributed across ontologies, while at the same time, they can filter irrelevant answers, fuse similar answers together, and elicit the most accurate answer(s) to a question.

A paradigm sensitive perspective on the ranking of accounting journals:a web-based survey approach

This paper reports the results of a web-based study of the perceptions of accounting journals in Australasia. Journal ranking studies have generally adopted citation techniques or used academics’ perceptions as the basis for assessing journal quality. Our research contributes to the existing literature by conducting a survey of academics in Australasia using a web-based instrument. The analysis indicates that the perceptions of the so-called “elite” accounting journals have become unsettled. The research highlights the emergence of more recent, alternative paradigm journals (CPA and AAAJ) as both highly ranking.

Using Sensitivity as a Method for Ranking the Test Cases Classified by Binary Decision Trees

Usually, data mining projects that are based on decision trees for classifying test cases will use the probabilities provided by these decision trees for ranking classified test cases. We have a need for a better method for ranking test cases that have already been classified by a binary decision tree because these probabilities are not always accurate and reliable enough. A reason for this is that the probability estimates computed by existing decision tree algorithms are always the same for all the different cases in a particular leaf of the decision tree. This is only one reason why the probability estimates given by decision tree algorithms can not be used as an accurate means of deciding if a test case has been correctly classified. Isabelle Alvarez has proposed a new method that could be used to rank the test cases that were classified by a binary decision tree [Alvarez, 2004]. In this paper we will give the results of a comparison of different ranking methods that are based on the probability estimate, the sensitivity of a particular case or both.

Algorithm of Consecutive Definition of Ranking of the Objects Nearest to the set Cyclic Relation between Objects

The problem of a finding of ranging of the objects nearest to the cyclic relation set by the expert between objects is considered. Formalization of the problem arising at it is resulted. The algorithm based on a method of the consecutive analysis of variants and the analysis of conditions of acyclicity is offered.

Programming Paradigms in Computer Science Education

Main styles, or paradigms of programming – imperative, functional, logic, and object-oriented – are shortly described and compared, and corresponding programming techniques are outlined. Programming languages are classified in accordance with the main style and techniques supported. It is argued that profound education in computer science should include learning base programming techniques of all main programming paradigms.

Excipients in medicines for children:scientific and regulatory paradigms

There is an ongoing debate over the use of pharmaceutical excipients in medicines for children, triggered by the increased number of formulations suitable for this target patient population. Pharmaceutical excipients can be regarded as essential / necessary enablers in formulation development. These are materials other than the 'active pharmaceutical ingredient' which are added to the formulation to achieve a specific function1. This may include aiding in the processing or manufacture of the drug delivery system such as lubricants or flow aids, controlling the release of the active ingredient to achieve modified release, enhance patient acceptability by improving taste of medicines or to develop easily swallowed dosage forms.

A framework for enabling dynamic e-business strategies via new enterprise paradigms and ERP solutions

In the global Internet economy, e-business as a driving force to redefine business models and operational processes is posing new challenges for traditional organizational structures and information system (IS) architectures. These are showing promises of a renewed period of innovative thinking in e-business strategies with new enterprise paradigms and different Enterprise Resource Planning (ERP) systems. In this chapter, the authors consider and investigate how dynamic e-business strategies, as the next evolutionary generation of e-business, can be realized through newly diverse enterprise structures supported by ERP, ERPII and so-called "ERPIII" solutions relying on the virtual value chain concept. Exploratory inductive multi-case studies in manufacturing and printing industries have been conducted. Additionally, it proposes a conceptual framework to discuss the adoption and governance of ERP systems within the context of three enterprise forms for enabling dynamic and collaborative e-business strategies, and particularly demonstrate how an enterprise can dynamically migrate from its current position to the patterns it desires to occupy in the future - a migration that must and will include dynamic e-business as a core competency, but that also relies heavily on ERP-based backbone and other robust technological platform and applications.

Exploiting heterogeneous scientific literature networks to combat ranking bias:evidence from the computational linguistics area

It is important to help researchers find valuable papers from a large literature collection. To this end, many graph-based ranking algorithms have been proposed. However, most of these algorithms suffer from the problem of ranking bias. Ranking bias hurts the usefulness of a ranking algorithm because it returns a ranking list with an undesirable time distribution. This paper is a focused study on how to alleviate ranking bias by leveraging the heterogeneous network structure of the literature collection. We propose a new graph-based ranking algorithm, MutualRank, that integrates mutual reinforcement relationships among networks of papers, researchers, and venues to achieve a more synthetic, accurate, and less-biased ranking than previous methods. MutualRank provides a unified model that involves both intra- and inter-network information for ranking papers, researchers, and venues simultaneously. We use the ACL Anthology Network as the benchmark data set and construct the gold standard from computer linguistics course websites of well-known universities and two well-known textbooks. The experimental results show that MutualRank greatly outperforms the state-of-the-art competitors, including PageRank, HITS, CoRank, Future Rank, and P-Rank, in ranking papers in both improving ranking effectiveness and alleviating ranking bias. Rankings of researchers and venues by MutualRank are also quite reasonable.

Implication of two new paradigms for futures studies

The paper considers the emergence of two recent perspectives in futures work. One is evolutionary futures studies. The other is critical futures studies. After describing aspects of each, the paper considers them as alternative rival paradigms in relation to criteria that include: the role of the human being as a subject, the role of interpretation and differences in methodological premises. It concludes that both have contributed to the development of futures methods but that a number of theoretical and methodological problems still remain unsolved.

Rangsorolás páros összehasonlításokkal. Kiegészítések a felvételizői preferencia-sorrendek módszertanához (Paired comparisons ranking. A supplement to the methodology of application-based preference ordering)

A Közgazdasági Szemle márciusi számában Telcs és szerzőtársai [2013] a felvételizők preferenciái alapján új megközelítést javasolt a felsőoktatási intézmények rangsorolására. Az alábbi írás új szempontokat biztosít ezen alapötlet gyakorlati megvalósításához. Megmutatja, hogy az alkalmazott modell ekvivalens az alternatívák egy aggregált páros összehasonlítási mátrix révén végzett rangsorolásával, ami rávilágít a szerzők kiinduló hipotéziseinek vitatható pontjaira. A szerző röviden áttekinti a hasonló feladatok megoldására javasolt módszereket, különös tekintettel azok axiomatikus megalapozására, majd megvizsgálja a Telcs és szerzőtársai [2013] által alkalmazott eljárásokat. Végül említést tesz egy hasonló megközelítéssel élő cikkről, és megfogalmaz néhány, a vizsgálat továbbfejlesztésére vonatkozó javaslatot. _____ In the March issue of Közgazdasági Szemle, Telcs et al. suggested a new approach to university ranking through preference ordering of applicants. The paper proposes new aspects to the implementation of this idea. It is shown that the model of these is equivalent to the ranking of alternatives based on paired comparisons, which reveals the debatable points in their hypotheses. The author reviews briefly the methods proposed in the literature, focusing on their axiomatic properties, and thoroughly examines the procedures of Telcs et al. [2013]. The paper presents an article which applied a similar approach and suggests some improvements to it.

Páros összehasonlításon alapuló pontozási eljárások monotonitása: önkonzisztencia és önkonzisztens monotonitás. Adalékok a pontozási eljárások axiomatikus tárgyalásához = Monotonicity of paired comparison-based ranking methods: self-consistency and self-consistent monotonicity. Contributions to an axiomatic analysis of scoring methods

A cikk a páros összehasonlításokon alapuló pontozási eljárásokat tárgyalja axiomatikus megközelítésben. A szakirodalomban számos értékelő függvényt javasoltak erre a célra, néhány karakterizációs eredmény is ismert. Ennek ellenére a megfelelő módszer kiválasztása nem egy-szerű feladat, a különböző tulajdonságok bevezetése elsősorban ebben nyújthat segítséget. Itt az összehasonlított objektumok teljesítményén érvényesülő monotonitást tárgyaljuk az önkonzisztencia és önkonzisztens monotonitás axiómákból kiindulva. Bemutatásra kerülnek lehetséges gyengítéseik és kiterjesztéseik, illetve egy, az irreleváns összehasonlításoktól való függetlenséggel kapcsolatos lehetetlenségi tétel is. A tulajdonságok teljesülését három eljárásra, a klasszikus pontszám eljárásra, az ezt továbbfejlesztő általánosított sorösszegre és a legkisebb négyzetek módszerére vizsgáljuk meg, melyek mindegyike egy lineáris egyenletrendszer megoldásaként számítható. A kapott eredmények új szempontokkal gazdagítják a pontozási eljárás megválasztásának kérdését. _____ The paper provides an axiomatic analysis of some scoring procedures based on paired comparisons. Several methods have been proposed for these generalized tournaments, some of them have been also characterized by a set of properties. The choice of an appropriate method is supported by a discussion of their theoretical properties. In the paper we focus on the connections of self-consistency and self-consistent-monotonicity, two axioms based on the comparisons of object's performance. The contradiction of self-consistency and independence of irrel-evant matches is revealed, as well as some possible reductions and extensions of these properties. Their satisfiability is examined through three scoring procedures, the score, generalised row sum and least squares methods, each of them is calculated as a solution of a system of linear equations. Our results contribute to the problem of finding a proper paired comparison based scoring method.

Svájci rendszerű sakk csapatversenyek rangsorolása (Ranking in Swiss system chess team tournaments)

A cikk a páros összehasonlításokon alapuló pontozási eljárásokat alkalmazza svájci rendszerű sakk csapatversenyek eredményének meghatározására. Bemutatjuk a nem körmérkőzéses esetben felmerülő kérdéseket, az egyéni és csapatversenyek jellemzőit, valamint a hivatalos lexikografikus rendezések hibáit. Axiomatikus alapokon rangsorolási problémaként modellezzük a bajnokságokat, definícióinkat összekapcsoljuk a pontszám, az általánosított sorösszeg és a legkisebb négyzetek módszerének tulajdonságaival. A javasolt eljárást két sakkcsapat Európa-bajnokság részletes elemzésével illusztráljuk. A végső rangsorok összehasonlítását távolságfüggvények segítségével végezzük el, majd a sokdimenziós skálázás révén ábrázoljuk azokat. A hivatalos sorrendtől való eltérés okait a legkisebb négyzetek módszerének dekompozíciójával tárjuk fel. A sorrendeket három szempont, az előrejelző képesség, a mintailleszkedés és a robusztusság alapján értékeljük, és a legkisebb négyzetek módszerének alkalmas eredménymátrixszal történő használata mellett érvelünk. ____ The paper uses paired comparison-based scoring procedures in order to determine the result of Swiss system chess team tournaments. We present the main challenges of ranking in these tournaments, the features of individual and team competitions as well as the failures of official lexicographical orders. The tournament is represented as a ranking problem, our model is discussed with respect to the properties of the score, generalised row sum and least squares methods. The proposed method is illustrated with a detailed analysis of the two recent chess team European championships. Final rankings are compared through their distances and visualized by multidimensional scaling (MDS). Differences to official ranking are revealed due to the decomposition of least squares method. Rankings are evaluated by prediction accuracy, retrodictive performance, and stability. The paper argues for the use of least squares method with an appropriate generalised results matrix favouring match points.