Qualitative input-output analysis and structural information

Symposium: Theoretical and Applied Input-Output Analysis: A New Synthesis

“…Until now, these new branches of the QIOA have been developed independently without much interaction by different economic research groups in Germany, France, USA and Israel. For example, qualitative input output analysis began in German speaking world with the work of Czayka (1972), Schnabl and Holub (1979), Holub, Schnabl and Tappeiner (1985), and were followed by further work of Holub and Tappeiner (1987), and Schnabl (1992. In France, some other applications of graph-theoretical methods for structuring production (so called causal channel method) have been brought forward by Bellet, Lallich and Vincent (1989) and the comcept of filieres introduction by De Bresson and Torre (199x).…”

Aggregate Measures of Complex Economic Structure and Evolution

“…They assembled the ( K ij ) into a transactions round matrix K showing the number of times sectors supply each other. According to Robinson and Markandya (1973, 125), the total number of transactions “measures the total amount of information required by the system to reach equilibrium (and thus is perhaps a good measure of the complexity of the system).” This measure was also used by Bosserman (1981) to describe ecosystems and by Schnabl and coworkers (Holub and Schnabl 1985; Weber and Schnabl 1998; Schnabl 1994) in qualitative input−output analysis and minimal flow analysis.…”

“…measures the total amount of information required by the system to reach equilibrium (and thus is perhaps a good measure of the complexity of the system)." This measure was also used by Bosserman (1981) to describe ecosystems and by Schnabl and coworkers (Holub and Schnabl 1985;Weber and Schnabl 1998;Schnabl 1994) in qualitative input−output analysis and minimal flow analysis. Chenery and Watanabe (1958) were the first to point out the use of input−output table triangulations for determining the degree of one-way interdependence within total interdependence.…”

Bayesian Optimization RSSI and Indoor location Algorithm of Iterative Least Square

“…In each period, there are uniquely different algorithms involved in, so that different range-based combining location program emerged. The conventional location program is very simple, such as PLM evolution program (inversion) in ranging period, and then getting a solution using least square method in location period (Lateration) [4,2]. For short description, in the paper this conventional combining program is called: PLM inversion+ Lateration.…”

“…[4]. In range-based location algorithm, the unknown node location is estimated by measuring the angle and distance between the anchor node (node with location already known) and the unknown node.…”