Search results for "Algorithms"
showing 10 items of 1716 documents
Automatic estimation of Purkinje-Myocardial junction hot-spots from noisy endocardial samples: A simulation study
2017
The reconstruction of the ventricular cardiac conduction system (CCS) from patient-specific data is a challenging problem. High-resolution imaging techniques have allowed only the segmentation of proximal sections of the CCS from images acquired ex vivo. In this paper, we present an algorithm to estimate the location of a set of Purkinje-myocardial junctions (PMJs) from electro-anatomical maps, as those acquired during radio-frequency ablation procedures. The method requires a mesh representing the myocardium with local activation time measurements on a subset of nodes. We calculate the backwards propagation of the electrical signal from the measurement points to all the points in the mesh …
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assessment.
2007
Abstract Background Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. However, the alignment methods seem inadequate for post-genomic studies since they do not scale well with data set size and they seem to be confined only to genomic and proteomic sequences. Therefore, alignment-free similarity measures are actively pursued. Among those, USM (Universal Similarity Metric) has gained prominence. It is based on the deep theory of Kolmogorov Complexity and universality is its most novel striking feature. Since it can only be approximated via data compression, USM is a methodology rath…
Cryptanalysis of Knapsack Cipher Using Ant Colony Optimization
2018
Ant Colony Optimization is a search metaheuristic inspired by the behavior of real ant colonies and shown their effectiveness, robustness to solve a wide variety of complex problems. In this paper, we present a novel Ant Colony Optimization (ACO) based attack for cryptanalysis of knapsack cipher algorithm. A Cipher-text only attack is used to discover the plaintext from the cipher-text. Moreover, our approach allows us to break knapsack cryptosystem in a minimum search space when compared with other techniques. Experimental results prove that ACO can be used as an effective tool to attack knapsack cipher.
An abstract inf-sup problem inspired by limit analysis in perfect plasticity and related applications
2021
This paper is concerned with an abstract inf-sup problem generated by a bilinear Lagrangian and convex constraints. We study the conditions that guarantee no gap between the inf-sup and related sup-inf problems. The key assumption introduced in the paper generalizes the well-known Babuška–Brezzi condition. It is based on an inf-sup condition defined for convex cones in function spaces. We also apply a regularization method convenient for solving the inf-sup problem and derive a computable majorant of the critical (inf-sup) value, which can be used in a posteriori error analysis of numerical results. Results obtained for the abstract problem are applied to continuum mechanics. In particular…
The integral‐direct coupled cluster singles and doubles model
1996
An efficient and highly vectorized implementation of the coupled cluster singles and doubles (CCSD) model using a direct atomic integral technique is presented. The minimal number of n6processes has been implemented for the most time consuming terms and point group symmetry is used to further reduce operation counts and memory requirements. The significantly increased application range of the CCSD method is illustrated with sample calculations on several systems with more than 500 basis functions. Furthermore, we present the basic trends of an open ended algorithm and discuss the use of integral prescreening. © 1996 American Institute of Physics.
Power estimation for non-standardized multisite studies
2016
A concern for researchers planning multisite studies is that scanner and T1-weighted sequence-related biases on regional volumes could overshadow true effects, especially for studies with a heterogeneous set of scanners and sequences. Current approaches attempt to harmonize data by standardizing hardware, pulse sequences, and protocols, or by calibrating across sites using phantom-based corrections to ensure the same raw image intensities. We propose to avoid harmonization and phantom-based correction entirely. We hypothesized that the bias of estimated regional volumes is scaled between sites due to the contrast and gradient distortion differences between scanners and sequences. Given this…
Automatic skull stripping in MRI based on morphological filters and fuzzy c-means segmentation
2012
In this paper a new automatic skull stripping method for T1-weighted MR image of human brain is presented. Skull stripping is a process that allows to separate the brain from the rest of tissues. The proposed method is based on a 2D brain extraction making use of fuzzy c-means segmentation and morphological operators applied on transversal slices. The approach is extended to the 3D case, taking into account the result obtained from the preceding slice to solve the organ splitting problem. The proposed approach is compared with BET (Brain Extraction Tool) implemented in MRIcro software.
Efficient and Accurate OTU Clustering with GPU-Based Sequence Alignment and Dynamic Dendrogram Cutting.
2015
De novo clustering is a popular technique to perform taxonomic profiling of a microbial community by grouping 16S rRNA amplicon reads into operational taxonomic units (OTUs). In this work, we introduce a new dendrogram-based OTU clustering pipeline called CRiSPy. The key idea used in CRiSPy to improve clustering accuracy is the application of an anomaly detection technique to obtain a dynamic distance cutoff instead of using the de facto value of 97 percent sequence similarity as in most existing OTU clustering pipelines. This technique works by detecting an abrupt change in the merging heights of a dendrogram. To produce the output dendrograms, CRiSPy employs the OTU hierarchical clusterin…
Numerical implementation of active power flow tracing methods: Practical implications on transmission networks and DR programs support
2015
The goal of this paper is to demonstrate the powerful contribution of the electric active power flow tracing methods on studying the electric transmission systems operating conditions. The tracing methods allow to impute to every generation unit and/or load the responsibility of the power flows of all the elements connected to the network. This study propose the numerical implementation of two different tracing methods on two transmission networks through Matlab® scripts developed on purpose; then the analysis is focused on identifying the loads which mostly affect the power line flows of the system. The results of this analysis point out the loads on which the application of the Demand Res…
Least-squares community extraction in feature-rich networks using similarity data
2021
We explore a doubly-greedy approach to the issue of community detection in feature-rich networks. According to this approach, both the network and feature data are straightforwardly recovered from the underlying unknown non-overlapping communities, supplied with a center in the feature space and intensity weight(s) over the network each. Our least-squares additive criterion allows us to search for communities one-by-one and to find each community by adding entities one by one. A focus of this paper is that the feature-space data part is converted into a similarity matrix format. The similarity/link values can be used in either of two modes: (a) as measured in the same scale so that one may …