Axiomatic Testing of Structure Metrics

Axiomatic testing of software metrics is described, based on axioms from representational measurement theory. In a case study, the axioms are given for the formal relational structure and the empirical relational structure. Two approaches to axiomatic testing are elaborated: deterministic testing and probabilistic testin

On Exact and Approximate Solutions for Hard Problems: An Alternative Look

We discuss in an informal, general audience style the da Costa-Doria conjecture about the independence of the P = NP hypothesis and try to briefly assess its impact on practical situations in economics. The paper concludes with a discussion of the Coppe-Cosenza procedure, which is an approximate, partly heuristic algorithm for allocation problems.P vs. NP , allocation problem, assignment problem, traveling salesman, exact solution for NP problems, approximate solutions for NP problems, undecidability, incompleteness

Thermal power systems small power systems applications project. Decision analysis for evaluating and ranking small solar thermal power system technologies. Volume 1: A brief introduction to multiattribute decision analysis

The principal concepts of the Keeney and Raiffa approach to multiattribute decision analysis are described. Topics discussed include the concepts of decision alternatives, outcomes, objectives, attributes and their states, attribute utility functions, and the necessary independence properties for the attribute states to be aggregated into a numerical representation of the preferences of the decision maker for the outcomes and decision alternatives

Measuring centrality by a generalization of degree

Network analysis has emerged as a key technique in communication studies, economics, geography, history and sociology, among others. A fundamental issue is how to identify key nodes, for which purpose a number of centrality measures have been developed. This paper proposes a new parametric family of centrality measures called generalized degree. It is based on the idea that a relationship to a more interconnected node contributes to centrality in a greater extent than a connection to a less central one. Generalized degree improves on degree by redistributing its sum over the network with the consideration of the global structure. Application of the measure is supported by a set of basic properties. A sufficient condition is given for generalized degree to be rank monotonic, excluding counter-intuitive changes in the centrality ranking after certain modifications of the network. The measure has a graph interpretation and can be calculated iteratively. Generalized degree is recommended to apply besides degree since it preserves most favourable attributes of degree, but better reflects the role of the nodes in the network and has an increased ability to distinguish among their importance.Comment: 20 pages, 8 figure