Search results for "ALGORITHM"

Identification Of P.Leu167Del Apoe Gene Mutation By Next Generation Sequencing In A Large Hypercholesterolemic Family

2019

Heuristics and meta-heuristics for 2-layer straight line crossing minimization

2003

AbstractThis paper presents extensive computational experiments to compare 12 heuristics and 2 meta-heuristics for the problem of minimizing straight-line crossings in a 2-layer graph. These experiments show that the performance of the heuristics (largely based on simple ordering rules) drastically deteriorates as the graphs become sparser. A tabu search metaheuristic yields the best results for relatively dense graphs, with a GRASP implementation as close second. Furthermore, the GRASP approach outperforms all other approaches when tackling low-density graphs.

Sampling methods for low-frequency electromagnetic imaging

2007

For the detection of hidden objects by low-frequency electromagnetic imaging the linear sampling method works remarkably well despite the fact that the rigorous mathematical justification is still incomplete. In this work, we give an explanation for this good performance by showing that in the low-frequency limit the measurement operator fulfils the assumptions for the fully justified variant of the linear sampling method, the so-called factorization method. We also show how the method has to be modified in the physically relevant case of electromagnetic imaging with divergence-free currents. We present numerical results to illustrate our findings, and to show that similar performance can b…

Elastic plastic analysis iterative solution

1998

The step-by-step analysis of finite element elastic plastic structures subjected to an assigned (quasi-static) loading history, is considered; it identifies with the well-known sequence of linear complementarity problems. An iterative technique devoted to solve the relevant linear complementarity problem is presented. It is based on the recursive solution of a suitable linear complementarity problem, deduced from the relevant one and easier than it. The procedure convergency is proved. Some noticing particular cases are examined. The physical meaning of the procedure is shown to be a plastic relaxation. The suitable numerical ranges for some check parameter values, to be utilized in the app…

Numerical Algorithms Based on Characteristic Domain Decomposition for Obstacle Problems

1997

A new numerical solution algorithm for obstacle problems is proposed, where the characteristic domain decomposition into active and inactive subdomains separated by the free boundary is approximated by a Schwarz method. Such an approach gives an opportunity to apply fast linear system solvers to genuinely non-linear obstacle problems. Other solution algorithms, like projected relaxation methods and active set strategies, are compared to the new solution algorithm. Numerical experiments related to the elastoplastic torsion problem are included showing the efficiency of the new approach.

Computation of a few smallest eigenvalues of elliptic operators using fast elliptic solvers

2001

The computation of a few smallest eigenvalues of generalized algebraic eigenvalue problems is studied. The considered problems are obtained by discretizing self-adjoint second-order elliptic partial differential eigenvalue problems in two- or three-dimensional domains. The standard Lanczos algorithm with the complete orthogonalization is used to compute some eigenvalues of the inverted eigenvalue problem. Under suitable assumptions, the number of Lanczos iterations is shown to be independent of the problem size. The arising linear problems are solved using some standard fast elliptic solver. Numerical experiments demonstrate that the inverted problem is much easier to solve with the Lanczos…

On spline methods of approximation under L-fuzzy information

2011

This work is closely related to our previous papers on algorithms of approximation under L-fuzzy information. In the classical theory of approximation central algorithms were worked out on the basis of usual, that is crisp splines. We describe central methods for solution of linear problems with balanced L-fuzzy information and develop the concept of L-fuzzy splines.

Real-time clothoid approximation by Rational Bezier curves

2008

This paper presents a novel technique for implementing Clothoidal real-time paths for mobile robots. As first step, rational Bezier curves are obtained as approximation of the Fresnel integrals. By rescaling, rotating and translating the previously computed RBC, an on-line Clothoidal path is obtained. In this process, coefficients, weights and control points are kept invariant. This on-line approach guarantees that an RBC has the same behavior as the original Clothoid using a low curve order. The resulting Clothoidal path allows any two arbitrary poses to be joined in a plane. RBCs working as Clothoids are also used to search for the shortest bounded-curvature path with a significant comput…

Reduced complexity models in the identification of dynamical networks: Links with sparsification problems

2009

In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be found in fields as diverse as Economics, Neuroscience and Biochemistry. The paper deals with the problem of deriving a descriptive model of a network, collecting the node outputs as time series with no use of a priori insight on the topology. We cast the problem as the optimization of a cost function operating a trade-off between accuracy and complexity in the final model. We address the problem of reducing the complexity by fixing a certain degree of sparsity, and trying to find the solution that “better” satisfi…

Reliable polygonal approximations of imaged real objects through dominant point detection

1998

Abstract The problem of dominant point detection is posed, taking into account what usually happens in practice. The algorithms found in the literature often prove their performance with laboratory contours, but the shapes in real images present noise, quantization, and high inter and intra-shape variability. These effects are analyzed and solutions to them are proposed. We will also focus on the conditions for an efficient (few points) and precise (low error) dominant point extraction that preserves the original shape. A measurement of the committed error (optimization error, E 0 ) that takes into account both aspects is defined for studying this feature.