Search results for "algorithm"
showing 10 items of 4887 documents
High Precision Conservative Surface Mesh Generation for Swept Volumes
2015
We present a novel, efficient, and flexible scheme to generate a high-quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. First, the approximation is conservative, i.e., the swept volume is enclosed by the generated mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined tolerance. Exploiting this tolerance the algorithm generates a mesh that is adapted to the local complexity of the swept volume boundary, keeping the overall output complexity remarkably low. The algorithm is two-phased: the actual sweep and the mesh generation. In the sweeping phase, we introduce a g…
A Fast Algorithm Finding the Shortest Reset Words
2013
In this paper we present a new fast algorithm for finding minimal reset words for finite synchronizing automata, which is a problem appearing in many practical applications. The problem is known to be computationally hard, so our algorithm is exponential in the worst case, but it is faster than the algorithms used so far and it performs well on average. The main idea is to use a bidirectional BFS and radix (Patricia) tries to store and compare subsets. Also a number of heuristics are applied. We give both theoretical and practical arguments showing that the effective branching factor is considerably reduced. As a practical test we perform an experimental study of the length of the shortest …
Encriptación óptica empleando llaves Weierstrass-Mandelbrot
2013
[EN] This paper presents the generation of encryption keys using the local oscillating properties of the partial sums of Weierstrass-Mandelbrot fractal function. In this way, the security key can be replicated if the parameters used to obtain it are known. Therefore, these parameters can be sent instead of sending the key. This procedure reduces the amount of information to be sent and prevents possible interception of the key. Moreover, the key can not be affected by data loss or pollution. The effectiveness of the Weierstrass-Mandelbrot keys were demonstrated by computer simulation in a 4f optical encryption system and the double random phase encoding technique. These keys allow us to enc…
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…
Two Parallel Algorithms for the Analysis of Random Images
1988
Aim of the paper is to show a computational paradigm, that reduces some algorithms on undirected graphs into image analysis algorithms. In particular two parallel algorithms on undirected weighted graphs, often used in the analysis of sparse images, are described.
On the Computation of Symmetrized M-Estimators of Scatter
2016
This paper focuses on the computational aspects of symmetrized Mestimators of scatter, i.e. the multivariate M-estimators of scatter computed on the pairwise differences of the data. Such estimators do not require a location estimate, and more importantly, they possess the important block and joint independence properties. These properties are needed, for example, when solving the independent component analysis problem. Classical and recently developed algorithms for computing the M-estimators and the symmetrized M-estimators are discussed. The effect of parallelization is considered as well as new computational approach based on using only a subset of pairwise differences. Efficiencies and…
Integer Weighted Regression Tsetlin Machines
2020
The Regression Tsetlin Machine (RTM) addresses the lack of interpretability impeding state-of-the-art nonlinear regression models. It does this by using conjunctive clauses in propositional logic to capture the underlying non-linear frequent patterns in the data. These, in turn, are combined into a continuous output through summation, akin to a linear regression function, however, with non-linear components and binary weights. However, the resolution of the RTM output is proportional to the number of clauses employed. This means that computation cost increases with resolution. To address this problem, we here introduce integer weighted RTM clauses. Our integer weighted clause is a compact r…
DORA algorithm for network flow models with improved stability and convergence properties
2001
A new methodology for the solution of shallow water equations is applied for the computation of the unsteady-state flow in an urban drainage network. The inertial terms are neglected in the momentum equations and the solution is decoupled into one kinematic and one diffusive component. After a short presentation of the DORA (Double ORder Approximation) methodology in the case of a single open channel, the new methodology is applied to the case of a sewer network. The transition from partial to full section and vice versa is treated without the help of the Preissmann approximation. The algorithm also allows the computation of the diffusive component in the case of vertical topographic discon…
A multi-domain approach for smoothed particle hydrodynamics simulations of highly complex flows
2018
Abstract An efficient and accurate method is proposed to solve the incompressible flow momentum and continuity equations in computational domains partitioned into subdomains in the framework of the smoothed particle hydrodynamics method. The procedure does not require any overlap of the subdomains, which would result in the increase of the computational effort. Perfectly matching solutions are obtained at the surfaces separating neighboring blocks. The block interfaces can be both planar and curved surfaces allowing to easily decompose even geometrically complex domains. The smoothing length of the kernel function is maintained constant in each subdomain, while changing between blocks where…