Search results for "Computational Mathematic"
showing 10 items of 987 documents
Effective strategies for targeted attacks to the network of Cosa Nostra affiliates
2022
AbstractNetwork dismantling has recently gained interest in the fields of intelligence agencies, anti-corruption analysts and criminal investigators due to its efficiency in disrupting the activity of malicious agents. Here, we apply this approach to detect effective strategies for targeted attacks to Cosa Nostra by analysing the collaboration network of affiliates that participate to the same crimes. We preliminarily detect statistically significant homophily patterns induced by being member of the same mafia syndicate. We also find that links between members belonging to different mafia syndicates play a crucial role in connecting the network into a unique component, confirming the releva…
The windowed scalogram difference: A novel wavelet tool for comparing time series
2017
Abstract We introduce a new wavelet-based tool called windowed scalogram difference (WSD), which has been designed to compare time series. This tool allows quantifying if two time series follow a similar pattern over time, comparing their scalograms and determining if they give the same weight to the different scales. The WSD can be seen as an alternative to another tool widely used in wavelet analysis called wavelet squared coherence (WSC) and, in some cases, it detects features that the WSC is not able to identify. As an application, the WSD is used to examine the dynamics of the integration of government bond markets in the euro area since the inception of the euro as a European single c…
On optimal estimates for the solutions of linear difference equations on the circle
1976
A linear difference equation arising in the proof of Moser's twist mapping theorem is solved and optimal estimates for the solution are established.
Navigationsformel zu A. Busemanns Variationsproblem der Raumfahrt
1970
Die Indikatrix des Variationsproblems wird auser durch die Storungsdifferentialgleichung fur die grose Halbachse und die Exzentrizitat durch einen Zusammenhang zwischen der Richtung des Impulsausstoses und der exzentrischen Anomalie gegeben. Die Hamilton-Gleichungen einer Extremalen reduzieren sich dann auf eine Navigationsgleichung. Die restlichen Storungsgleichungen fur die Perihellange und die mittlere Lange der Epoche geben schlieslich den sparsamsten zeitlichen Ablauf des Raketenausstoses.
Splineapproximationen von beliebigem Defekt zur numerischen L�sung gew�hnlicher Differentialgleichungen. Teil III
1980
In the first part [5] a general procedure is presented to obtain polynomial spline approximations of arbitrary defect for the solution of the initial value problem of ordinary differential equations. The essential result is a divergence theorem in dependence of the polynomial degree and the defect of the spline functions. In this second part the convergent procedures are investigated and two convergence theorems are proved. Furthermore the question is treated, whether the convergent procedures are appropriate for the numerical solution of stiff equations. The paper is finished by a convergence theorem for a procedure producing spline approximations in a natural way by the discrete approxima…
Maximale Konvergenzordnung bei der numerischen Lösung von Anfangswertproblemen mit Splines
1982
In [10] a general procedureV is presented to obtain spline approximations by collocation for the solutions of initial value problems for first order ordinary differential equations. In this paper the attainable order of convergence with respect to the maximum norm is characterized in dependence of the parameters involved inV; in particular the appropriate choice of the collocation points is considered.
Shooting methods for 1D steady-state free boundary problems
1993
AbstractIn this note, we present two numerical methods based on shooting methods to solve steady-state diffusion-absorption models.
On the path representation of networks
1982
A compact data structure for networks is obtained by storing arcs of paths sequentially. This structure allows forward and backward access from a node to its neighbors.
An Analysis of the Influence of Noneffective Instructions in Linear Genetic Programming
2020
Abstract Linear Genetic Programming (LGP) represents programs as sequences of instructions and has a Directed Acyclic Graph (DAG) dataflow. The results of instructions are stored in registers that can be used as arguments by other instructions. Instructions that are disconnected from the main part of the program are called noneffective instructions, or structural introns. They also appear in other DAG-based GP approaches like Cartesian Genetic Programming (CGP). This article studies four hypotheses on the role of structural introns: noneffective instructions (1) serve as evolutionary memory, where evolved information is stored and later used in search, (2) preserve population diversity, (3)…