19 resultados para Proofs
Resumo:
Identifiability of the so-called ω-slice algorithm is proven for ARMA linear systems. Although proofs were developed in the past for the simpler cases of MA and AR models, they were not extendible to general exponential linear systems. The results presented in this paper demonstrate a unique feature of the ω-slice method, which is unbiasedness and consistency when order is overdetermined, regardless of the IIR or FIR nature of the underlying system, and numerical robustness.
Resumo:
This paper analyses the effect of job accessibility by public and private transport on labour market outcomes in the metropolitan area of Barcelona. Beyond employment, we consider the effect of job accessibility on job-education mismatch, which represents a relevant aspect of job quality. We adopt a recursive system of equations that models car availability, employment and mismatch. Public transport accessibility appears as an exogenous variable in the three equations. Even though it may reflect endogenous residential sorting, falsification proofs suggest that the estimated effect of public transport accessibility is not entirely driven by the endogenous nature of residential decisions.
Resumo:
The De Dea Syria belongs, in the manuscript tradition, to the corpus of Lucian of Samosata. His authorship, however, has been discussed: while some perceive in it clear non-lucianic elements, others do not find them conclusive proofs, considering the usual evasive character of Lucian. Assuming that his author is actually Lucian -or, in any case, a hellenized Syrian of imperial times-, the analysis of descriptions, narrative, language and narrator-text, give valuable information on fusion and interaction among cultures in the Roman Empire. KEYWORDS: Cultural identity - Religion - Roman Empire - Lucian of Samosata
Resumo:
We prove the existence and local uniqueness of invariant tori on the verge of breakdown for two systems: the quasi-periodically driven logistic map and the quasi-periodically forced standard map. These systems exemplify two scenarios: the Heagy-Hammel route for the creation of strange non- chaotic attractors and the nonsmooth bifurcation of saddle invariant tori. Our proofs are computer- assisted and are based on a tailored version of the Newton-Kantorovich theorem. The proofs cannot be performed using classical perturbation theory because the two scenarios are very far from the perturbative regime, and fundamental hypotheses such as reducibility or hyperbolicity either do not hold or are very close to failing. Our proofs are based on a reliable computation of the invariant tori and a careful study of their dynamical properties, leading to the rigorous validation of the numerical results with our novel computational techniques.