Search results for "Parallel"
showing 10 items of 667 documents
Technical and economical comparison between different topologies of PV plant under mismatch effect
2014
This paper presents a technical and economical comparative analysis between two topology of photovoltaic plant. In particular the performances of series-parallel (SP) and total cross tied (TCT), topologies are taken into account, referring to a partially shaded photovoltaic plant. Thanks to a simulation model developed, in the paper the mismatch effects due to three different shading conditions, for SP and TCT topology plant, are quantified. Since the TCT solution, even though increase the energy production, raise the complexity of plants as well as their costs, an evaluation of the individual costs of each component of a SP and TCT plant topology, as PV modules, support structure, inverter…
Abstract – Using Parallel Corpora for Translation Activities in L2 Medical English Undergraduate Teaching, with Specific Reference to Italian Sports …
2021
English is the international language of science and, as such, it is also the international language of medicine. L2 English undergraduates do not generally have particular difficulties in translating from English into their mother tongue; by contrast, they do not perform very well when asked to translate into English. The aim of this report is to show the results of a study obtained by using parallel corpora in scientific English classes in the Italian sports sciences study course of the University of Palermo. The students were provided with a corpus of English texts taken from a well-known medical text with pedagogical purposes, and their corresponding Italian translations, which were car…
A parallel simulated annealing approach to the K shortest loopless paths problem
1997
The k shortest loopless paths problem is a significant combinatorial problem which arises in many contexts. When the size of the networks is very large the exact algorithms fail to find the best solution in a reasonable time. The aim of this paper is to suggest parallel efficient algorithms to obtain a good approximation of the solution to the k shortest loopless paths problem between two arbitrary nodes, when the network size is large. The heuristic used is known in literature as Simulated Annealing. Preliminary tests have been conducted for evaluating the validity of the proposed algorithms. The quality of the obtained results represents a significant base for further experimentations.
IDEA: interface dynamics and energetics algorithm.
2007
IDEA, interface dynamics and energetics algorithm, was implemented, in FORTRAN, under different operating systems to mimic dynamics and energetics of elementary events involved in interfacial processes. The code included a parallel elaboration scheme in which both the stochastic and the deterministic components, involved in the developed physical model, worked simultaneously. IDEA also embodied an optionally running VISUAL subroutine, showing the dynamic energy changes caused by the surface events, e.g., occurring at the gas-solid interface. Monte Carlo and ordinary differential equation system subroutines were employed in a synergistic way to drive the occurrence of the elementary events a…
Parallel Schwarz methods for convection-dominated semilinear diffusion problems
2002
AbstractParallel two-level Schwarz methods are proposed for the numerical solution of convection-diffusion problems, with the emphasis on convection-dominated problems. Two variants of the methodology are investigated. They differ from each other by the type of boundary conditions (Dirichlet- or Neumann-type) posed on a part of the second-level subdomain interfaces. Convergence properties of the two-level Schwarz methods are experimentally compared with those of a variant of the standard multi-domain Schwarz alternating method. Numerical experiments performed on a distributed memory multiprocessor computer illustrate parallel efficiency of the methods.
Optimized Parallel Implementation of Face Detection based on GPU component
2015
Display Omitted An algorithm for face detection has been implemented on CPU.An acceleration of this algorithm on GPU migration.Performance of GPU implementation shows the effectiveness of this implementation.Another optimization method on GPU are operated. Face detection is an important aspect for various domains such as: biometrics, video surveillance and human computer interaction. Generally a generic face processing system includes a face detection, or recognition step, as well as tracking and rendering phase. In this paper, we develop a real-time and robust face detection implementation based on GPU component. Face detection is performed by adapting the Viola and Jones algorithm. We hav…
Parallel and scalable short-read alignment on multi-core clusters using UPC++
2016
[Abstract]: The growth of next-generation sequencing (NGS) datasets poses a challenge to the alignment of reads to reference genomes in terms of alignment quality and execution speed. Some available aligners have been shown to obtain high quality mappings at the expense of long execution times. Finding fast yet accurate software solutions is of high importance to research, since availability and size of NGS datasets continue to increase. In this work we present an efficient parallelization approach for NGS short-read alignment on multi-core clusters. Our approach takes advantage of a distributed shared memory programming model based on the new UPC++ language. Experimental results using the …
The combined distribution/assignment problem in transportation network planning: a parallel approach on hypercube architecture
1995
The joint distribution/assignment problem plays a central role in urban transport network planning. In this problem, according to the mathematical model proposed by S. P. Evans, the trips are iteratively calculated and assigned to the network in such a way that the resulting traffic flows pattern satisfies the selfish equilibrium condition. Unfortunately the number of variables and constraints increase hardly with the greatness of the networks causing long computational time for the equilibrium solution. In this paper an nCUBE 2 parallel computing architecture is employed to solve the combined problem and to asses the potential of MIMD machines to handle large scale transportation network p…
Classifier Optimized for Resource-constrained Pervasive Systems and Energy-efficiency
2017
Computational intelligence is often used in smart environment applications in order to determine a user’scontext. Many computational intelligence algorithms are complex and resource-consuming which can beproblematic for implementation devices such as FPGA:s, ASIC:s and low-level microcontrollers. Thesetypes of devices are, however, highly useful in pervasive and mobile computing due to their small size,energy-efficiency and ability to provide fast real-time responses. In this paper, we propose a classi-fier, CORPSE, specifically targeted for implementation in FPGA:s, ASIC:s or low-level microcontrollers.CORPSE has a small memory footprint, is computationally inexpensive, and is suitable for…
A distributed genetic algorithm for restoration of vertical line scratches
2008
This paper reports a distributed algorithm for the restoration of still frames corrupted by vertical line scratches. The restoration is here approached as an optimisation problem, and is solved using an ad-hoc Genetic Algorithm. The distributed algorithm is designed following a pipeline logical structure. The front end is a network of standard workstations with heterogeneous operating systems. The quality of image is appreciable and the computational time is quite low with respect the sequential version.