| |
|
We consider the problem of short-time extrapolation of blue chips' stocks indexes in the context of wavelet subspaces following the theory proposed by X.-G. Xia and co-workers in a series of papers \cite{XLK,XKZ,LK,LXK}. The idea is first to approximate the oscillations of the corresponding stock… |
| |
|
We introduce a notion of uniform convergence for local and nonlocal curvatures. Then, we propose an abstract method to prove the convergence of the corresponding geometric flows, within the level set formulation. We apply such a general theory to characterize the limits of s-fractional mean… |
| |
|
Malware for smartphones has rocketed over the last years. Market operators face the challenge of keeping their stores free from malicious apps, a task that has become increasingly complex as malware developers are progressively using advanced techniques to defeat malware detection tools. One such… |
| |
|
Clustering is one of the most important unsupervised learning problems and it consists of finding a common
structure in a collection of unlabeled data. However, due to the ill-posed nature of the problem, different
runs of the same clustering algorithm applied to the same data-set usually produce… |
| |
|
Switchable and adaptive substrates emerged as valuable tools for the control of wetting and actuation
of droplet motion. Here we report a computational study of the dynamics of an unstable thin liquid
film deposited on a switchable substrate, modelled with a space and time varying contact angle.… |
| |
|
We present the results of a computational study of the entire left coronary system simulated both at Newtonian level and at red blood cell resolution for a sizeable number of physiological conditions. We analyze the cardiovascular implications of stenotic plaques and show that the standard clinical… |
| |
|
|
| |
|
|
| |
|
We present a new method for assessing and measuring homophily in networks whose nodes have categorical attributes, namely when the nodes of networks come partitioned into classes (colors). We probe this method in two different classes of networks: (i) protein-protein interaction (PPI) networks,… |
| |
|
In this paper, a general approach to de la Vallée Poussin means is given and the resulting near best polynomial approximation is stated by developing simple sufficient conditions to guarantee that the Lebesgue constants are uniformly bounded. Not only the continuous case but also the discrete… |
