A theoretical framework to conceptualize measure of behaviour complexity (BC), system complexity (SC) and task complexity (TC) was developed. From this framework cognitive complexity (CC) is derived as CC = SC + TC BC. In an empirical study to investigate different measures of cognitive complexity 6 beginners and 6 experts solved 4 different tasks with an interactive database management system....

A framework to conceptualize measure of behaviour complexity (BC), system complexity (SC) and task complexity (TC) was developed. From this framework cognitive complexity (CC) is derived as CC = SC + TC BC. In an empirical study to investigate different measures of cognitive complexity 6 beginners and 6 experts solved 4 different tasks with an interactive database management system. To analyze ...

In the Even Set problem, the input consists of a family F of subsets of a universe U and an integer k; the question is to find a nonempty set A ⊆ U of size at most k such that |A ∩ F | is even for every F ∈ F . Alternatively, the question can be stated as finding a nonzero codeword of Hamming weight at most k in a linear code over F2. The question of parameterized complexity of this problem, pa...

Cristian Calude et al. in [5] have recently introduced the idea of measuring the degree of difficulty of a mathematical problem (even those still given as conjectures) by the length of a program to verify or refute the statement. The method to evaluate and compare problems, in some objective way, will be discussed in this note. For the practitioner, wishing to apply this method using a standard...

Programs are, nowadays, considered to be complex systems. Entropy and Correlation are the most widely used metrics available for the analysis of complex systems. This paper compares the application of these sorts of metrics, in the evaluation of the program organization. We verify that, the metrics based on the correlation are the most valuable for the identification of the program organizations.

Multiparty communication complexity was first defined by Chandra, Furst, and Lipton [6] and used to obtain lower bounds on branching programs. Since then it has been used to get additional lower bounds and tradeoffs for branching programs [1, 3], lower bounds on problems in data structures [3], time-space tradeoffs for restricted Turing machines [1], and unconditional pseudorandom generators fo...

A definition is proposed for a size measure to be used as a parameter for algorithm analysis in any algebra. The parameter is simply the straight-line program length in the associated free algebra. This parameter generalizes the usual measures in basic arithmetic and string algebras, as well as some apparently different measures used for data structure algorithms. Another use is illustrated wit...

Achieving and maintaining high software quality is most dependent on how easily the software engineer least familiar with the system can understand the system’s code. Understanding attributes of cognitive processes can lead to new software metrics that allow the prediction of human performance in software development and for assessing and improving the understandability of text and code. In thi...

It is well known that a program execution exhibits time-varying behavior, i.e., a program typically goes through a number of phases during its execution with each phase exhibiting relatively homogeneous behavior within a phase and distinct behavior across phases. In fact, several recent research studies have been exploiting this time-varying behavior for various purposes. This paper proposes ph...