Search results for "Tribute"
showing 10 items of 1455 documents
Fiber laser with combined feedback of core and cladding modes assisted by an intracavity long-period grating
2011
We present a fiber laser made in a single piece of conventional doped-core fiber that operates by combined feedback of the fundamental core mode LP((0,1)) and the high-order cladding mode LP((0,10)). The laser is an all-fiber structure that uses two fiber Bragg gratings and a long-period grating to select the modes circulating in the cavity; the laser emits at the coupling wavelength between the core mode LP((0,1)) and the counterpropagating cladding mode LP((0,10)) in the Bragg gratings. This work demonstrates the feasibility of high-order mode fiber lasers assisted by long-period gratings.
Q-switched all-fiber laser based on magnetostriction modulation of a Bragg grating
2009
We report an actively Q-switched all-fiber laser based on magnetostriction modulation of a Bragg grating. The laser employs a pair of Bragg gratings as reflective mirrors, one of which is bonded to a magnetostrictive element. Lengthening of the magnetostrictive element when a magnetic field is applied shifts the Bragg wavelength of the grating, allowing control of the Q-factor of the cavity and, thus, performing active Q-switching. The magnetostrictive modulator is small, compact and requires less than 300 mW electrical drive power. Using erbium-doped fiber and a maximum pump power of 120 mW, Q-switch pulses of more than 1 W peak power were obtained, with a pulse repetition rate that can be…
Place-based attributes and spatial expenditure behavior in tourism
2017
In recent discussions on local sustainable development, notions like “local for local” and “home bias” have often played a role. The purpose of this paper is to investigate whether preferences for specific place-based attributes might constrain or support tourism participation and tourism destination choice of distinct socioeconomic groups of visitors. To test this proposition, a large data set from the Italian Households Budget Survey for the period 1997–2007 has been used and, by means of the double-hurdle model, tourism participation and expenditure are modeled over the life-cycle of tourists. These data are next merged with location-specific attributes including natural amenities and in…
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.
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.
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.
PenRed: An extensible and parallel Monte-Carlo framework for radiation transport based on PENELOPE
2021
Monte Carlo methods provide detailed and accurate results for radiation transport simulations. Unfortunately, the high computational cost of these methods limits its usage in real-time applications. Moreover, existing computer codes do not provide a methodology for adapting these kind of simulations to specific problems without advanced knowledge of the corresponding code system, and this restricts their applicability. To help solve these current limitations, we present PenRed, a general-purpose, stand-alone, extensible and modular framework code based on PENELOPE for parallel Monte Carlo simulations of electron-photon transport through matter. It has been implemented in C++ programming lan…
A linear approach for the nonlinear distributed parameter identification problem
1991
In identifying the nonlinear distributed parameters we propose an approach, which enables us to identify the nonlinear distributed parameters by just solving linear problems. In this approach we just need to identify linear parameters and then recover the nonlinear parameters from the identified linear parameters. An error estimate for the finite element approximation is derived. Numerical tests are also presented.
The complexity of graph languages generated by hyperedge replacement
1990
Although in many ways, hyperedge replacement graph grammars (HRGs) are, among all graph generating mechanisms, what context-free Chomsky grammars are in the realm of string rewriting, their parsing problem is known to be, in general, NP-complete. In this paper, the main difficulty in HRG parsing is analysed and some conditions on either grammar or input graphs are developed under which parsing can be done in polynomial time. For some of the cases, the parsing problem is shown to be log-space reducible to context-free string parsing.