Search results for "Dean"
showing 10 items of 278 documents
Criminal networks analysis in missing data scenarios through graph distances
2021
Data collected in criminal investigations may suffer from issues like: (i) incompleteness, due to the covert nature of criminal organizations; (ii) incorrectness, caused by either unintentional data collection errors or intentional deception by criminals; (iii) inconsistency, when the same information is collected into law enforcement databases multiple times, or in different formats. In this paper we analyze nine real criminal networks of different nature (i.e., Mafia networks, criminal street gangs and terrorist organizations) in order to quantify the impact of incomplete data, and to determine which network type is most affected by it. The networks are firstly pruned using two specific m…
GEM
2014
The widespread use of digital sensor systems causes a tremendous demand for high-quality time series analysis tools. In this domain the majority of data mining algorithms relies on established distance measures like Dynamic Time Warping (DTW) or Euclidean distance (ED). However, the notion of similarity induced by ED and DTW may lead to unsatisfactory clusterings. In order to address this shortcoming we introduce the Gliding Elastic Match (GEM) algorithm. It determines an optimal local similarity measure of a query time series Q and a subject time series S. The measure is invariant under both local deformation on the measurement-axis and scaling in the time domain. GEM is compared to ED and…
A study on spectral optimisation in partial response CPM signals
1995
An optimisation technique for the minimisation of the effective bandwidth in partial response CPM signals is described. The minimum Euclidean distance is used as optimisation constraint because the bit error probability is a function of this parameter for high values of signal to noise ratio. The procedure has been implemented for a correlation length corresponding to two signalling intervals. The optimisation problem leads to a system of two nonlinear differential equations for the pulse shape, together with some boundary conditions. Numerical solution of the differential equations has been performed; initial conditions have been adjusted, to satisfy the boundary conditions using an iterat…
Data Mining Algorithms for Knowledge Extraction
2020
In this paper, we study the methods, techniques, and algorithms used in data mining, and from the studied algorithms, we emphasized the clustering algorithms, more precisely on the K-means algorithm. This algorithm was first studied using the Euclidean distance, then modifying the distance between the clusters using the distances Mahalanobis and Canberra. After implementing the algorithms in C/C++, we compared the clustering of the three algorithms, after which we modified them and studied the distance between the clusters.
G. Herglotz’ Behandlung von Beschleunigungswellen in seiner Vorlesung «Mechanik der Kontinua» angewandt auf die Stosswellen von Christoffel
1981
Following a lecture delivered by Herglotz in 1925/26 we briefly treat acceleration waves in hyperelastic materials. Our main result is a divergence equation for the squared Euclidean norm of the so-called ‘wave vector’. We then apply Herglotz’ method (devised for acceleration waves) to the propagation of such first order discontinuities in elastic bodies as were treated by Christoffel in [1].
Modeling the Mechanical Behavior of the Breast Tissues Under Compression in Real Time
2017
This work presents a data-driven model to simulate the mechanical behavior of the breast tissues in real time. The aim of this model is to speed up some multimodal registration algorithms, as well as some image-guided interventions. Ten virtual breast phantoms were used in this work. Their deformation during a mammography was performed off-line using the finite element method. Three machine learning models were trained with the data from those simulations. Then, they were used to predict the deformation of the breast tissues. The models were a decision tree and two ensemble methods (extremely randomized trees and random forest). Four experiments were designed to assess the performance of th…
Universal natural shapes: From unifying shape description to simple methods for shape analysis and boundary value problems
2012
Gielis curves and surfaces can describe a wide range of natural shapes and they have been used in various studies in biology and physics as descriptive tool. This has stimulated the generalization of widely used computational methods. Here we show that proper normalization of the Levenberg-Marquardt algorithm allows for efficient and robust reconstruction of Gielis curves, including self-intersecting and asymmetric curves, without increasing the overall complexity of the algorithm. Then, we show how complex curves of k-type can be constructed and how solutions to the Dirichlet problem for the Laplace equation on these complex domains can be derived using a semi-Fourier method. In all three …
RootsGLOH2: embedding RootSIFT 'square rooting' in sGLOH2
2020
This study introduces an extension of the shifting gradient local orientation histogram doubled (sGLOH2) local image descriptor inspired by RootSIFT ‘square rooting’ as a way to indirectly alter the matching distance used to compare the descriptor vectors. The extended descriptor, named RootsGLOH2, achieved the best results in terms of matching accuracy and robustness among the latest state-of-the-art non-deep descriptors in recent evaluation contests dealing with both planar and non-planar scenes. RootsGLOH2 also achieves a matching accuracy very close to that obtained by the best deep descriptors to date. Beside confirming that ‘square rooting’ has beneficial effects on sGLOH2 as it happe…
Distributed and proximity-constrained C-means for discrete coverage control
2018
In this paper we present a novel distributed coverage control framework for a network of mobile agents, in charge of covering a finite set of points of interest (PoI), such as people in danger, geographically dispersed equipment or environmental landmarks. The proposed algorithm is inspired by C-Means, an unsupervised learning algorithm originally proposed for non-exclusive clustering and for identification of cluster centroids from a set of observations. To cope with the agents' limited sensing range and avoid infeasible coverage solutions, traditional C-Means needs to be enhanced with proximity constraints, ensuring that each agent takes into account only neighboring PoIs. The proposed co…
Combinatorial proofs of two theorems of Lutz and Stull
2021
Recently, Lutz and Stull used methods from algorithmic information theory to prove two new Marstrand-type projection theorems, concerning subsets of Euclidean space which are not assumed to be Borel, or even analytic. One of the theorems states that if $K \subset \mathbb{R}^{n}$ is any set with equal Hausdorff and packing dimensions, then $$ \dim_{\mathrm{H}} π_{e}(K) = \min\{\dim_{\mathrm{H}} K,1\} $$ for almost every $e \in S^{n - 1}$. Here $π_{e}$ stands for orthogonal projection to $\mathrm{span}(e)$. The primary purpose of this paper is to present proofs for Lutz and Stull's projection theorems which do not refer to information theoretic concepts. Instead, they will rely on combinatori…