Search results for " algorithms"
showing 10 items of 612 documents
An enhanced random walk algorithm for delineation of head and neck cancers in PET studies
2017
An algorithm for delineating complex head and neck cancers in positron emission tomography (PET) images is presented in this article. An enhanced random walk (RW) algorithm with automatic seed detection is proposed and used to make the segmentation process feasible in the event of inhomogeneous lesions with bifurcations. In addition, an adaptive probability threshold and a k-means based clustering technique have been integrated in the proposed enhanced RW algorithm. The new threshold is capable of following the intensity changes between adjacent slices along the whole cancer volume, leading to an operator-independent algorithm. Validation experiments were first conducted on phantom studies:…
Splitting the data cache: a survey
2000
Recent cache-memory research has focused on approaches that split the first-level data cache into two independent subcaches. The authors introduce a methodology for helping cache designers devise splitting schemes and survey a representative set of the published cache schemes.
Identifying the k Best Targets for an Advertisement Campaign via Online Social Networks
2020
We propose a novel approach for the recommendation of possible customers (users) to advertisers (e.g., brands) based on two main aspects: (i) the comparison between On-line Social Network profiles, and (ii) neighborhood analysis on the On-line Social Network. Profile matching between users and brands is considered based on bag-of-words representation of textual contents coming from the social media, and measures such as the Term Frequency-Inverse Document Frequency are used in order to characterize the importance of words in the comparison. The approach has been implemented relying on Big Data Technologies, allowing this way the efficient analysis of very large Online Social Networks. Resul…
Clique Percolation Method: Memory Efficient Almost Exact Communities
2022
Automatic detection of relevant groups of nodes in large real-world graphs, i.e. community detection, has applications in many fields and has received a lot of attention in the last twenty years. The most popular method designed to find overlapping communities (where a node can belong to several communities) is perhaps the clique percolation method (CPM). This method formalizes the notion of community as a maximal union of $k$-cliques that can be reached from each other through a series of adjacent $k$-cliques, where two cliques are adjacent if and only if they overlap on $k-1$ nodes. Despite much effort CPM has not been scalable to large graphs for medium values of $k$. Recent work has sho…
Fragile Correctness of Social Network Analysis
2016
Draft version of the paper
Laboratory testing of Beerkan infiltration experiments for assessing the role of soil sealing on water infiltration
2018
Abstract Soil surface sealing is a major cause of decreased infiltration rates and increased surface runoff and erosion during a rainstorm. The objective of this paper is to quantify the effect of surface sealing on infiltration for 3 layered soils with different textures for the upper layer and investigate the capability of BEST procedure to catch the formation of the seal and related consequences on water infiltration. Rainfall experiments were carried out to induce the formation of the seal. Meanwhile, Beerkan infiltration runs were carried out pouring water at different distances from the soil surface (BEST-H versus BEST-L runs, with a High and Low water pouring heights, respectively) f…
Special factors and the combinatorics of suffix and factor automata
2011
AbstractThe suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministic automaton recognizing the set of suffixes (resp. factors) of w. We study the relationships between the structure of the suffix and factor automata and classical combinatorial parameters related to the special factors of w. We derive formulae for the number of states of these automata. We also characterize the languages LSA and LFA of words having respectively suffix automaton and factor automaton with the minimal possible number of states.
Quantum Machine Learning: A tutorial
2021
This tutorial provides an overview of Quantum Machine Learning (QML), a relatively novel discipline that brings together concepts from Machine Learning (ML), Quantum Computing (QC) and Quantum Information (QI). The great development experienced by QC, partly due to the involvement of giant technological companies as well as the popularity and success of ML have been responsible of making QML one of the main streams for researchers working on fuzzy borders between Physics, Mathematics and Computer Science. A possible, although arguably coarse, classification of QML methods may be based on those approaches that make use of ML in a quantum experimentation environment and those others that take…
Combining split-and-merge and multi-seed region growing algorithms for uterine fibroid segmentation in MRgFUS treatments
2016
Uterine fibroids are benign tumors that can affect female patients during reproductive years. Magnetic resonance-guided focused ultrasound (MRgFUS) represents a noninvasive approach that uses thermal ablation principles to treat symptomatic fibroids. During traditional treatment planning, uterus, fibroids, and surrounding organs at risk must be manually marked on MR images by an operator. After treatment, an operator must segment, again manually, treated areas to evaluate the non-perfused volume (NPV) inside the fibroids. Both pre- and post-treatment procedures are time-consuming and operator-dependent. This paper presents a novel method, based on an advanced direct region detection model, …
Probabilistic analysis of truss structures with uncertain parameters (virtual distortion method approach)
2004
A new approach for probabilistic characterization of linear elastic redundant trusses with uncertainty on the various members subjected to deterministic loads acting on the nodes of the structure is presented. The method is based on the simple observation that variations of structural parameters are equivalent to superimposed strains on a reference structure depending on the axial forces on the elastic modulus of the original structure as well as on the uncertainty (virtual distortion method approach). Superposition principle may be applied to separate contribution to mechanical response due to external loads and parameter variations. Statically determinate trusses dealt with the proposed m…