The Maximum Common Subgraph problem has been long proven NP-hard. Nevertheless, it countless practical applications, and researchers are still searching for exact solutions scalable heuristic approaches. Driven by applications in molecular science cyber-security, we concentrate on the among an indefinite number of graphs. We first extend a state-of-the-art branch-and-bound procedure working two...

The primary goal of Federal Reserve monetary policy is to foster maximum long-term growth in the U.S. economy by achieving price stability over time. Price stability will be achieved, according to some definitions, when inflation ceases to be a factor in the decision-making processes of businesses and individuals. Although the Federal Reserve has made considerable progress toward price stabilit...

The primary goal of Federal Reserve monetary policy is to foster maximum long-term growth in the U.S. economy by achieving price stability over time. Price stability will be achieved, according to some definitions, when inflation ceases to be a factor in the decisionmaking processes of businesses and individuals. Although the Federal Reserve has made considerable progress toward price stability...

We consider the simple pendulum equation −u′′(t) + f(u′(t)) = λ sinu(t), t ∈ I := (−1, 1), u(t) > 0, t ∈ I, u(±1) = 0, where 0 < ≤ 1, λ > 0, and the friction term is either f(y) = ±|y| or f(y) = −y. Note that when f(y) = −y and = 1, we have well known original damped simple pendulum equation. To understand the dependance of solutions, to the damped simple pendulum equation with λ 1, upon the te...

In this paper, we obtain the main term of the average stochastic complexity for certain complete bipartite graph-type spin models in Bayesian estimation. We study the Kullback function of the spin model by using a new method of eigenvalue analysis first and use a recursive blowing up process for obtaining the maximum pole of the zeta function which is defined by using the Kullback function. The...

We study confluence and the Church-Rosser property in term rewriting and λ-calculus with explicit bounds on term sizes and reduction lengths. Given a system R, we are interested in the lengths of the reductions in the smallest valleys t→∗ s′ ∗← t′ expressed as a function: — for confluence a function vsR(m,n) where the valleys are for peaks t ∗← s→∗ t′ with s of size at most m and the reductions...

In this paper, at first we derive a family of maximum Tsallis entropy distributions under optional side conditions on the mean income and the Gini index. Furthermore, corresponding with these distributions a family of Lorenz curves compatible with the optional side conditions is generated. Meanwhile, we show that our results reduce to Shannon entropy as $beta$ tends to one. Finally, by using ac...

Many natural records exhibit long-term correlations characterized by a power-law decay of the autocorrelation function, C(s) approximately s-gamma, with time lag s and correlation exponent 0<gamma<1. We study how the presence of such correlations affects the statistics of the extreme events, i.e., the maximum values of the signal within time segments of the fixed duration R. We find numerically...