Search results for "Parallel"

EFFECT OF SHAPE ON POTATO AND CAULIFLOWER SHRINKAGE DURING DRYING

2000

ABSTRACT Shrinkage of potato cubes, parallelepipeds and cylinders was addressed during drying. A basic methodology by using image analysis was set-up in order to measure and monitor geometrical changes along the drying process. Both measurements by image analysis and directly with a calliper were carried out. Results from both methods showed a good agreement with no bias. Particle shape was found to influence shrinkage in a different way according to the axis. In fact the larger dimension shrinks less than the shorter one. This could be linked to the influence of the core drying in shrinkage. Experiments were also carried out for cauliflower stems. The difference in shrinkage between direct…

Mathematical analysis of projection errors in “paralleling technique” with respect to implant geometry

2001

Abstract: “Standardized” radiographs acquired in paralleling technique serve for monitoring of marginal bone levels around endosseous implants. Under clinical conditions, parallel adjustment of the film to the implant is beset with great difficulties. A mathematical model matching clinical conditions was developed to evaluate projection geometry within an interval of clinically relevant angulations (± 10° from parallel position). Radiographs of two implants (Frialit 2, Friadent AG, Mannheim, Germany; Implant No. 1: ∅ 3.8 mm, length 10 mm; Implant No. 2: ∅ 6.5 mm, length 13 mm) were separately produced per angulation (2° increments) at one focus-object distance (FO=322.9 mm). Implant images …

Anisotropy of the stiffness and strength of rigid low-density closed-cell polyisocyanurate foams

2016

The cells of polymer foams are usually extended in the foam rise direction, causing a geometrical anisotropy, the degree of which, characterized by the cell aspect ratio R, depends on foam density and production method. Such elongated cell shape translates into anisotropy of the mechanical properties of foams. Rigid low-density closed-cell polyisocyanurate foams of apparent density ranging from ca. 30 to 75 kg/m3, containing polyols derived from renewable resources, have been produced and tested for the stiffness and strength in the foam rise and transverse directions in order to experimentally characterize their mechanical anisotropy. Analytical relations for foams with rectangular paralle…

Diagonalization of large matrices: a new parallel algorithm.

2015

On the basis of a dressed matrices formalism, a new algorithm has been devised for obtaining the lowest eigenvalue and the corresponding eigenvector of large real symmetric matrices. Given an N × N matrix, the proposed algorithm consists in the diagonalization of (N - 1)2 × 2 dressed matrices. Both sequential and parallel versions of the proposed algorithm have been implemented. Tests have been performed on a Hilbert matrix, and the results show that this algorithm is up 340 times faster than the corresponding LAPACK routine for N = 10(4) and about 10% faster than the Davidson method. The parallel MPI version has been tested using up to 512 nodes. The speed-up for a N = 10(6) matrix is fair…

Soft Sensor Transferability between Lines of a Sulfur Recovery Unit

2021

Abstract Soft Sensors (SSs) are mathematical models that allow real-time estimation of hard-to-measure variables as a function of easy-to-measure ones in an industrial process, emulating the behavior of existing sensors when they are, for instance, taken off for maintenance. The Sulfur Recovery Unit (SRU) from a refinery is taken in exam. Recurrent Neural Networks (RNN) can capture the nonlinearity of such process but present a high complexity training and a very time-consuming structure optimization. For this reason, strategies to use pre-existing models are here examined by testing the transferability of the SSs between two parallel lines of the process.

A parallel variable neighborhood search approach for the obnoxious p -median problem

2018

Towards Multilevel Ant Colony Optimisation for the Euclidean Symmetric Traveling Salesman Problem

2015

Ant Colony Optimization ACO metaheuristic is one of the best known examples of swarm intelligence systems in which researchers study the foraging behavior of bees, ants and other social insects in order to solve combinatorial optimization problems. In this paper, a multilevel Ant Colony Optimization MLV-ACO for solving the traveling salesman problem is proposed, by using a multilevel process operating in a coarse-to-fine strategy. This strategy involves recursive coarsening to create a hierarchy of increasingly smaller and coarser versions of the original problem. The heart of the approach is grouping the variables that are part of the problem into clusters, which is repeated until the size…

A Simple Metaheuristic for the FleetSize and Mix Problem with TimeWindows

2017

This paper presents a powerful new single-parameter metaheuristic to solve the Fleet Size and Mix Vehicle Routing Problem with Time Windows. The key idea of the new metaheuristic is to perform a random number of random-sized jumps in random order through four well-known local search operators. Computational testing on the 600 large-scale benchmarks of Bräysy et al. (Expert Syst Appl 36(4):8460–8475, 2009) show that the new metaheuristic outperforms previous best approaches, finding 533 new best-known solutions. Despite the significant number of random components, it is demonstrated that the variance of the results is rather low. Moreover, the suggested metaheuristic is shown to scale almost…

An Island Strategy for Memetic Discrete Tomography Reconstruction

2014

In this paper we present a parallel island model memetic algorithm for binary discrete tomography reconstruction that uses only four projections without any further a priori information. The underlying combination strategy consists in separated populations of agents that evolve by means of different processes. Agents progress towards a possible solution by using genetic operators, switch and a particular compactness operator. A guided migration scheme is applied to select suitable migrants by considering both their own and their sub-population fitness. That is, from time to time, we allow some individuals to transfer to different subpopulations. The benefits of this paradigm were tested in …

An ILS-Based Metaheuristic for the Stacker Crane Problem

2012

[EN] In this paper we propose a metaheuristic algorithm for the Stacker Crane Problem. This is an NP-hard arc routing problem whose name derives from the practical problem of operating a crane. Here we present a formulation and a lower bound for this problem and propose a metaheuristic algorithm based on the combination of a Multi-start and an Iterated Local Search procedures. Computational results on a large set of instances are presented.