Lower and upper bounds for the largest Lyapunov exponent of matrices
We introduce a new approach to evaluate the largest Lyapunov exponent of a family of nonnegative matrices. The method is based on using special positive homogeneous functionals on , which gives iterative lower and upper bounds for the Lyapunov exponent. They improve previously known bounds and converge to the real value. The rate of convergence is estimated and the efficiency of the algorithm is demonstrated on several problems from applications (in functional analysis, combinatorics, and language theory) and on numerical examples with randomly generated matrices. The method computes the Lyapunov exponent with a prescribed accuracy in relatively high dimensions (up to 60). We generalize this approach to all matrices, not necessarily nonnegative, derive a new universal upper bound for the Lyapunov exponent, and show that a potential similar lower bound does not exist in general.
At the particular article we provide a methodological approach to selection of companies for horizontal cooperation in procurement logistics. In context of modern logistics (globalization, high customer expectations, high transportation costs), and changes regarding Russia’s plans to join WTO, this topic is highly relevant from a practical point of view. The purpose of this article is to provide single methodological approach to selection of companies for horizontal cooperation.
1. Description of the problem. Instrumental analysis makes it possible to find the arguments of adjudication on the bounders and structure of corpus delicti, its correlation to criminal and filling-up legislation. 2. Initial theses. Corpus delicti is regarded as that expressed in criminal law doctrine result of reorganization of orders of criminal law into other practically necessary form. That happens in the process of theory and practical experience accumulation. The construction of corpus delicti is transformed for practical needs, textually expressed system of features, regulated by criminal law and characterizing deeds as a crime of a definite type. Correlation of construction of corpus delicti with law and doctrine. Corpus delicti, its algorithm. Transition from law regulations to corpus delicti can be done: 1) prog-nostically; 2) within constant analysis of law; 3) in the process of law application. 3. Stages of instrumental building of corpus delicti: prognostic, doctrinal, law applicatory. Instrumental approach to corpus delicti includes within each stage: 1) based on criminal law decision of classification of corpus delicti and its borders; 2) objective description of a factual model; 3) acception of meaning correlated with legal notions and constructions; 4) choice of the construction of the corpus delicti and disposal of characteristics; 5) verification of legitimacy, necessity and adequacy of foundation. 4. Instrumental analysis of disputable questions of understanding and application of constructions of corpus delicti. A. Functions and purposes of application of construction of corpus delicti. Functions of corpus delicti: a) modeling; b) communicative; c) identificatory; d) technological. B. Contents of corpus delicti. Contents of corpus delicti as it is traditionally regarded does not correspond to indications of crime, does not characterize features of social danger; sign of danger of penalty also does go into corpus delicti. Two variants are proposed for the discussion: widening of the borders of corpus delicti by means of introduction of signs of social danger and signs, defining individualization of penalty and to limitate corpus delicti by characteristic of criminally punished act, separating it from contents of guilt and contents of social danger. C. Structure of corpus delicti. There are two problems: division of elements of crime seems to be extremely harsh and inadequate - it is expedient to include signs of special and time limits of act, causal links, crossing signs of objective and subjective sides, first of all consequences and an object of crime, into the structure of corpus delicti. Forms of committing a criminally punished act is a crime commitment in complicity, ideal system, not finished crime.
We define, calculate and analyze irregularity indices λISSN of daily series of the International Sunspot Number ISSN as a function of increasing smoothing from N = 162 to 648 days. The irregularity indices λ are computed within 4-year sliding windows, with embedding dimensions m = 1 and 2. λISSN displays Schwabe cycles with ~5.5-year variations ("half Schwabe variations" HSV). The mean of λISSN undergoes a downward step and the amplitude of its variations strongly decreases around 1930. We observe changes in the ratio R of the mean amplitude of λ peaks at solar cycle minima with respect to peaks at solar maxima as a function of date, embedding dimension and, importantly, smoothing parameter N. We identify two distinct regimes, called Q1 and Q2, defined mainly by the evolution of R as a function of N: Q1, with increasing HSV behavior and R value as N is increased, occurs before 1915–1930; and Q2, with decreasing HSV behavior and R value as N is increased, occurs after ~1975. We attempt to account for these observations with an autoregressive (order 1) model with Poissonian noise and a mean modulated by two sine waves of periods T1 and T2 (T1 = 11 years, and intermediate T2 is tuned to mimic quasi-biennial oscillations QBO). The model can generate both Q1 and Q2 regimes. When m = 1, HSV appears in the absence of T2 variations. When m = 2, Q1 occurs when T2 variations are present, whereas Q2 occurs when T2 variations are suppressed. We propose that the HSV behavior of the irregularity index of ISSN may be linked to the presence of strong QBO before 1915–1930, a transition and their disappearance around 1975, corresponding to a change in regime of solar activity.
We present an approach based on a two-stage ltration of the set of feasible solutions for the multiprocessor job-shop scheduling problem. On the rst stage we use extensive dominance relations, whereas on the second stage we use lower bounds. We show that several lower bounds can eciently be obtained and implemented.