Search results for "Algorithm"
showing 10 items of 4887 documents
F.A.L.C.A.D.E.: a fuzzy software for the energy and environmental balances of products
2004
Abstract It is generally well known that the reliability of Life Cycle Analysis (LCA) studies depends upon exact, complete and sharp input data that, unfortunately, are not always available. Furthermore, when available, the input data are affected by uncertainty whose importance is not always adequately taken into consideration. This paper describes the software F.A.L.C.A.D.E. (Fuzzy Approach to Life Cycle Analysis and Decision Environment): a tool designed for the calculation of the eco-profile of products, based on a fuzzy logic approach. The originality of the method already treated in other papers is to use the fuzzy representation to manage the complex relationships that arise in compi…
Quality based classification of gasoline samples by ATR-FTIR spectrometry using spectral feature selection with quadratic discriminant analysis
2013
Abstract A chemometric approach has been developed for characterization of gasoline samples regarding their quality. Attenuated total reflectance – infrared spectrometric data were processed by genetic algorithm (GA) and successive projection algorithm (SPA) feature selection techniques, being employed as an initial step prior to apply a discriminative tool. It was aimed to classify the fuel samples according to their quality passed/failed data. Chemometric predictive procedures were developed using quadratic discriminant analysis (QDA) combined with GA and SPA as a feature subset and feature selection strategy. Results showed 93.3% and 95.6% accuracy for SPA-QDA and GA-QDA models respectiv…
Multi-dimensional pattern matching with dimensional wildcards
1995
We introduce a new multi-dimensional pattern matching problem, which is a natural generalization of the on-line search in string matching. We are given a text matrix A[1: n1, ..., 1:n d ] of size N= n1×n2×...×n d , which we may preprocess. Then, we are given, online, an r-dimensional pattern matrix B[1:m1,...,1:m r ] of size M= m1×m2×...×m r , with 1≤r≤d. We would like to know whether B*=B*[*, 1:m1,*, ...,1: mr, *] occurs in A, where * is a dimensional wildcard such that B* is any d-dimensional matrix having size 1 × ... × m1×...1×m r ×...1 and containing the same elements as B. Notice that there might be (d/r)≤2d occurrences of B* for each position of A. We give CRCW-PRAM algorithms for pr…
Phantomuntersuchung zur Optimierung der Spiral-CT und 3 D-Rekonstruktion des Tracheobronchialsystems
1996
PURPOSE To optimise three-dimensional spiral CT of the tracheobronchial tree using adequate acquisition and reconstruction parameters for spiral CT of the chest. MATERIAL AND METHODS Qualitative and quantitative assessment of different 3 D reconstructions of two test objects of the tracheobronchial tree depending on section thickness, reconstruction interval, pitch, and reconstruction algorithm used in spiral CT (Siemens, Somatom plus S) of the chest. The frequency of volume and stairstep artifacts was evaluated. The 3 D reconstructions were generated using a seeded VOI-technique (Allegro, ISG). RESULTS Reduction of artifacts was achieved by decreasing section thickness. Increasing overlap …
Diagnosis and Planning in Immediate Loading: Implant Selection
2019
Despite the increasing patients’ desire for immediate prosthetic loading of implants, several factors must be taken into account before pursuing the immediate loading (IL) protocol. In general, the number, size, characterization, and distribution of implants should be based on the implant-prosthodontic plan, arch form, and available bone quality and quantity, regardless of the loading protocol. However, implant selection in IL represents one of the most important clinical challenges due to the primary stability requirement.
Treatment of Hereditary Angioedema with the Mutation c.988A>G (p.K330E) in the Plasminogen Gene
2020
Inference of Spatiotemporal Processes over Graphs via Kernel Kriged Kalman Filtering
2018
Inference of space-time signals evolving over graphs emerges naturally in a number of network science related applications. A frequently encountered challenge pertains to reconstructing such dynamic processes given their values over a subset of vertices and time instants. The present paper develops a graph-aware kernel-based kriged Kalman filtering approach that leverages the spatio-temporal dynamics to allow for efficient online reconstruction, while also coping with dynamically evolving network topologies. Laplacian kernels are employed to perform kriging over the graph when spatial second-order statistics are unknown, as is often the case. Numerical tests with synthetic and real data ill…
A family of kernel anomaly change detectors
2014
This paper introduces the nonlinear extension of the anomaly change detection algorithms in [1] based on the theory of reproducing kernels. The presented methods generalize their linear counterparts, under both the Gaussian and elliptically-contoured assumptions, and produce both improved detection accuracies and reduced false alarm rates. We study the Gaussianity of the data in Hilbert spaces with kernel dependence estimates, provide low-rank kernel versions to cope with the high computational cost of the methods, and give prescriptions about the selection of the kernel functions and their parameters. We illustrate the performance of the introduced kernel methods in both pervasive and anom…
Modified LACIF filtering in background disjoint noise
2011
Abstract This work deals with pattern recognition methods based on correlations for images in the presence of noise. We propose a modification of the nonlinear Locally Adaptive Contrast Invariant Filter (LACIF) that yields correlation peaks that are invariant to linear intensity changes of the target but that has some limitations in the presence low variance nonoverlapping background noise. The modification of the filter implies a normalization by a global variance of several distributions. The estimation of the variance distributions is done locally by means of correlations. Experimental results as well as comparisons with the classical matched filter and the common LACIF are given.
Fractional-Fourier-transform calculation through the fast-Fourier-transform algorithm.
1996
A method for the calculation of the fractional Fourier transform (FRT) by means of the fast Fourier transform (FFT) algorithm is presented. The process involves mainly two FFT’s in cascade; thus the process has the same complexity as this algorithm. The method is valid for fractional orders varying from −1 to 1. Scaling factors for the FRT and Fresnel diffraction when calculated through the FFT are discussed.