We consider multiple criteria decision-making problems where a group of decision-makers wants to find the most preferred solution from a discrete set of alternatives. We develop a method that uses achievement scalarizing functions for charting subsets of reference points that would support a certain alternative to be the most preferred one. The resulting descriptive information is provided to t...

This study introduces the Constructed Response Analysis Tool (CRAT), a freely available tool to automatically assess student responses in online tutoring systems. The study tests CRAT on a dataset of chemistry responses collected in the ChemVLab+. The findings indicate that CRAT can differentiate and classify student responses based on semantic overlap with student input and indices related to ...

The purpose of this study was to formulate a simplistic method of assessing human structural dysplasia and to validate a classification system that would objectively categorize the type and extent of such dysplasia through the use of indices. Anthropometric measurements were taken from a sample of 222 male college students, length/breadth ratios were formulated, and upper/lower body classificat...

Introduction: Almost all studies on dynamic contrast-enhanced MRI (DCE-MRI) in the spine [1,2] are based on descriptive perfusion indices like maximum signal enhancement. These suffer from well-known limitations like dependence on experimental variables and an ill-defined relation to hemodynamic parameters. Quantitative analysis with the Tofts model resolves the first issue, but not the second ...

We aim to generalize Büchi’s fundamental theorem on the coincidence of recognizable and MSO-definable languages to a weighted timed setting. For this, we investigate weighted timed automata and show how we can extend Wilke’s relative distance logic with weights taken from an arbitrary semiring. We show that every formula in our logic can effectively be transformed into a weighted timed automato...

Our goal is to study the complexity of infinite binary recursive sequences. We introduce several measures of the quantity of information they contain. Some measures are based on size of programs that generate the sequence, the others are based on the Kolmogorov complexity of its finite prefixes. The relations between these complexity measures are established. The most surprising among them are ...

This paper surveys two related lines of research: Logical characterizations of (non-deterministic) linear time complexity classes, and non-expressibility results concerning sublogics of existential second-order logic. Starting from Fagin's fundamental work there has been steady progress in both elds with the eeect that the weakest logics that are used in characterizations of linear time complex...

The main factor of intelligence is defined as the ability to comprehend, formalising this ability with the help of new constructs based on descriptional complexity. The result is a comprehension test, or C-test, which is exclusively defined in computational terms. Due to its absolute and non-anthropomorphic character, it is equally applicable to both humans and non-humans. Moreover, it correlat...

The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descriptive complexity is to make use of games on graphs played between two players, called the spoiler and the duplicator. There are two types of these games, which differ in the order in which the spoiler and duplicator make...