Metrics plays an important role in the software modularization. Several metrics have been discussed so far. This paper describes a metrics based on control structures which is a minor modification of McCabe’s approach. Proposed novel approach is a control structure based complexity (CSBC) which is used to compute the complexity by counting the control structures directly from the source code ra...

3 21/21=100 44/61=72.1 54/56=96.4 119/138=86.2 4 21/21=100 46/61=75.4 53/56=94.6 120/138=86.9 5 21/21=100 47/61=77 53/56=94.6 121/138=87.7 6 21/21=100 47/61=77 53/56=94.6 121/138=87.7 7 21/21=100 50/61=81.9 52/56=92.8 123/138=89.1 8 21/21=100 50/61=81.9 53/56=94.6 124/138=89.8 9 21/21=100 49/61=80.3 53/56=94.6 123/138=89.1 10 21/21=100 48/61=78.7 51/56=91 120/138=86.9 Performance of SPDR-CM for...

February 2001 An algorithm is a set of equations that is executed in a logical sequence to produce an external output. In the fields of function point analysis and operations research, an algorithm can be seen as a critical tool to reduce effort needed to solve a complex series of calculations. We have written this paper focusing on intermediate function point analysis theory, and use linear pr...

We introduce a new sample complexity measure, which we refer to as split-sample growth rate. For any hypothesis H and for any sample S of size m, the split-sample growth rate τ̂H(m) counts how many different hypotheses can empirical risk minimization output on any sub-sample of S of size m/2. We show that the expected generalization error is upper bounded by O ( √

Techniques to determine changing system complexity from data are evaluated. Convergence of a frequently used correlation dimension algorithm to a finite value does not necessarily imply an underlying deterministic model or chaos. Analysis of a recently developed family of formulas and statistics, approximate entropy (ApEn), suggests that ApEn can classify complex systems, given at least 1000 da...

We investigate physical measures and limits of intelligence that are objective and useful. We propose a universal measure of operator induction fitness, and show how it can be used in a reinforcement learning model, and a self-preserving agent model based on the free energy principle. We extend logical depth and conceptual jump size measures to stochastic domains, and elucidate their relations....

HDDT breast-y 286 9 2 2.36 HDDT compustat 13657 20 2 25.26 HDDT covtype 38500 10 2 13.02 HDDT credit-g 1000 20 2 2.33 HDDT estate 5322 12 2 7.37 HDDT german-numer 1000 24 2 2.33 HDDT heart-v 200 13 2 2.92 HDDT hypo 3163 25 2 19.95 HDDT ism 11180 6 2 42.00 HDDT letter 20000 16 2 24.35 HDDT oil 937 49 2 21.85 HDDT page 5473 10 2 8.77 HDDT pendigits 10992 16 2 8.63 HDDT phoneme 5404 5 2 2.41 HDDT ...

Lower bound for the shape complexity measure of López-Ruiz-Mancini-Calbet (LMC), C LM C , is derived. Analytical relations for simple examples of the harmonic oscillator, the hydrogen atom and two-electron 'entangled artificial' atom proposed by Moshinsky are derived. Several numerical examples of the spherically confined model systems are presented as the test cases. For the homogeneous potent...

We propose a refinement of the usual Ehrenfeucht-Fräıssé game. The new game will help us make finer distinctions than the traditional one. In particular, it can be used to measure not only quantifier rank but also lengths of conjunctions and disjunctions needed for expressing a given property. Our game is similar to the game in [1] and in [5]. The most common measure of complexity of a first or...

A key problem in implicit computational complexity is to analyse the impact on program run times of nesting restricted control structures, such as for-do statements in imperative languages. This problem has two aspects. One is whether there are methods of extracting information from the syntax of such programs that give insight as to why some nesting of control structures may cause a blow up in...