Economists included knowledge their models to improve their explanatory accuracy. A major step was to describe the production of knowledge as well as its exploitation as an internal part of economic models. Politicians prefer to talk about a new kind of economy so they can sustain the myth of progress. Rather than explain economies using a new model they try to leave economic history intact whi...

We propose extensions of the classical JSM-method and the Naı̈ve Bayesian classifier for the case of triadic relational data. We performed a series of experiments on various types of data (both real and synthetic) to estimate quality of classification techniques and compare them with other classification algorithms that generate hypotheses, e.g. ID3 and Random Forest. In addition to classificati...

This paper presents a discriminating approach to detecting the existence of underlying determinism in speech phonemes using the surrogate data method. The discrimination is made using a statistical measurement of neighboring trajectory directions. This approach is experimentally verified with both deterministic and stochastic time series and then applied to speech phonemes from the TIMIT databa...

the reciprocal degree distance (rdd)‎, ‎defined for a connected graph $g$ as vertex-degree-weighted sum of the reciprocal distances‎, ‎that is‎, ‎$rdd(g) =sumlimits_{u,vin v(g)}frac{d_g(u)‎ + ‎d_g(v)}{d_g(u,v)}.$ the reciprocal degree distance is a weight version of the harary index‎, ‎just as the degree distance is a weight version of the wiener index‎. ‎in this paper‎, ‎we present exact formu...

In social networks the Strong Triadic Closure is an assignment of the edges with strong or weak labels such that any two vertices that have a common neighbor with a strong edge are adjacent. The problem of maximizing the number of strong edges that satisfy the strong triadic closure was recently shown to be NP-complete for general graphs. Here we initiate the study of graph classes for which th...