Search results for "Algorithms"
showing 10 items of 1716 documents
Textureless macula swelling detection with multiple retinal fundus images
2011
Retinal fundus images acquired with nonmydriatic digital fundus cameras are versatile tools for the diagnosis of various retinal diseases. Because of the ease of use of newer camera models and their relatively low cost, these cameras can be employed by operators with limited training for telemedicine or point-of-care (PoC) applications. We propose a novel technique that uses uncalibrated multiple-view fundus images to analyze the swelling of the macula. This innovation enables the detection and quantitative measurement of swollen areas by remote ophthalmologists. This capability is not available with a single image and prone to error with stereo fundus cameras. We also present automatic alg…
A genetic integrated fuzzy classifier
2005
This paper introduces a new classifier, that is based on fuzzy-integration schemes controlled by a genetic optimisation procedure. Two different types of integration are proposed here, and are validated by experiments on real data sets of biological cells. The performance of our classifier is tested against a feed-forward neural network and a Support Vector Machine. Results show the good performance and robustness of the integrated classifier strategies.
Paradigm of tunable clustering using Binarization of Consensus Partition Matrices (Bi-CoPaM) for gene discovery
2013
Copyright @ 2013 Abu-Jamous et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Clustering analysis has a growing role in the study of co-expressed genes for gene discovery. Conventional binary and fuzzy clustering do not embrace the biological reality that some genes may be irrelevant for a problem and not be assigned to a cluster, while other genes may participate in several biological functions and should simultaneously belong to multiple clusters. Also, these algorithms cannot generate tight cluster…
A heuristic fuzzy algorithm for assessing and managing tourism sustainability
2019
“Smartness” and “sustainability” are gaining growing attention from both practitioners and policy makers. “Smartness” and “sustainability” assessments are of crucial importance for directing, in a systemic perspective, the decision-making process toward sustainability and smart growth objectives. Sustainability assessment is a major challenge due to the multidisciplinary aspects involved that make the evaluation process complex and hinder the effectiveness of available monitoring tools. To achieve the assessment objective, we introduce an enhanced fuzzy logic-based framework for handling the inherent uncertainty and vagueness of the involved variables: we apply our approach to Italy, and we…
Three-circle method in the investigations of shapes of gas bubble clusters in two-phase flow
1991
We present an attempt of formulating a quantitative criterion for division into homogeneous and heterogeneous flow patterns basing on the probabilistic analysis of gas bubble distribution in the liquid
Experimental-Like Affinity Constants and Enantioselectivity Estimates from Flexible Docking
2012
Experimental-like affinity constants and enantioselectivity estimates, not predicted so far computationally, were obtained using a novel flexible modeling/docking combined strategy. The S- and R-warfarin-human serum albumin (HSA, site I) complexes were used as an interaction model. The process for a verified estimation includes the following: (i) ionized open chain forming at physiological pH (a recent focus); (ii) conformational search (molecular mechanics and Monte Carlo methods); (iii) rigid protein-flexible ligand docking (GlideXP) generating low energy paired S- and R-poses; (iv) graphical comparison against the X-ray crystal structure (unsatisfactory verification step); (v) quantum po…
Word assembly through minimal forbidden words
2006
AbstractWe give a linear-time algorithm to reconstruct a finite word w over a finite alphabet A of constant size starting from a finite set of factors of w verifying a suitable hypothesis. We use combinatorics techniques based on the minimal forbidden words, which have been introduced in previous papers. This improves a previous algorithm which worked under the assumption of stronger hypothesis.
From Nerode's congruence to Suffix Automata with mismatches
2009
AbstractIn this paper we focus on the minimal deterministic finite automaton Sk that recognizes the set of suffixes of a word w up to k errors. As first result we give a characterization of the Nerode’s right-invariant congruence that is associated with Sk. This result generalizes the classical characterization described in [A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, J. Seiferas, The smallest automaton recognizing the subwords of a text, Theoretical Computer Science, 40, 1985, 31–55]. As second result we present an algorithm that makes use of Sk to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r of a text, where r is the…
Motif patterns in 2D
2008
AbstractMotif patterns consisting of sequences of intermixed solid and don’t-care characters have been introduced and studied in connection with pattern discovery problems of computational biology and other domains. In order to alleviate the exponential growth of such motifs, notions of maximal saturation and irredundancy have been formulated, whereby more or less compact subsets of the set of all motifs can be extracted, that are capable of expressing all others by suitable combinations. In this paper, we introduce the notion of maximal irredundant motifs in a two-dimensional array and develop initial properties and a combinatorial argument that poses a linear bound on the total number of …
On the exhaustive generation of k-convex polyominoes
2017
The degree of convexity of a convex polyomino P is the smallest integer k such that any two cells of P can be joined by a monotone path inside P with at most k changes of direction. In this paper we present a simple algorithm for computing the degree of convexity of a convex polyomino and we show how it can be used to design an algorithm that generates, given an integer k, all k-convex polyominoes of area n in constant amortized time, using space O(n). Furthermore, by applying few changes, we are able to generate all convex polyominoes whose degree of convexity is exactly k.