In this paper we consider a semitetrad covariant decomposition of spherically symmetric spacetimes and find governing hyperbolic equation the Gaussian curvature two dimensional spherical shells, that emerges due to decomposition. The restoration factor travelling wave allows us construct geometric measure complexity. This depends critically on curvature, demonstrate connection complexity for fi...

There are different facets of software complexity, some of which have been computed using widely accepted metrics like cyclomatic complexity, data/information flow metrics, but very less attempts have been made to measure the cognitive aspect of the complexity. The human mind's efforts needed for the comprehension of the source code reflect a different dimension of complexity, which is being me...

About Pearson Pearson, the global leader in education and education technology, provides innovative print and digital education materials for preK through college, student information systems and learning management systems, teacher licensure testing, teacher professional development, career certification programs, and testing and assessment products that set the standard for the industry. Pear...

This research investigates the validity of the layout complexity metric to GUI screen design. This metric offers a simple method to gauge the complexity of the visual design of a computer screen by classifying screen objects into classes based on common dimensions and positions. However, though it has been used by other interface researchers, it is not clear that it is a valid metric for GUIs. ...

This paper describes a novel fuzzy based approach to determine the complexity of an image which is independent of a human perception criterion. The proposed method determines the complexity of an image based on the analysis of its edge level percentages. First, the method determines the complexity class of an image from among three classes, Little Complex, More or Less Complex, and Very Complex...

This study examined the effects of cognitive task complexity increase on the complexity, accuracy, and fluency (CAF) as well as the temporal distribution of the cognitive and metacognitive processes involved in computer-mediated L2 written production. To this end, the study employed a between-subjects experimental design with 85 EFL learners from a language learning institute in Iran. Participa...

We define a complexity measure on non-deterministic Büchi automata, based on the notion of the width of the skeleton tree introduced by Kähler and Wilke. We show that the induced hierarchy tightly correlates to the Wagner Hierarchy, a corner stone in the theory of regular ω-languages that is derived from a complexity measure on deterministic Muller automata. The relation between the hierarchies...

The complexity of a Boolean function can be expressed in terms of computational work. We present experimental data in support of the entropy definition of computational work based upon the Inputoutput description of a Boolean function. Our data show a linear relationship between the computational work and the average number of literals in a multi-level implementation. The Investigation includes...