Search results for " code"
showing 10 items of 636 documents
OpenMolcas: From Source Code to Insight
2019
In this article we describe the OpenMolcas environment and invite the computational chemistry community to collaborate. The open-source project already includes a large number of new developments realized during the transition from the commercial MOLCAS product to the open-source platform. The paper initially describes the technical details of the new software development platform. This is followed by brief presentations of many new methods, implementations, and features of the OpenMolcas program suite. These developments include novel wave function methods such as stochastic complete active space self-consistent field, density matrix renormalization group (DMRG) methods, and hybrid multico…
L’accertamento del trasferimento d’azienda in caso di cambio di appalto nel rito “Fornero”
2021
Con la sentenza n. 2315/2020 la Suprema Corte ha affermato il principio che l’accertamento dell’anzianità di servizio conseguente ad un trasferimento d’azienda può essere affrontato nell’ambito del rito speciale di impugnazione del licenziamento introdotto dalla L. n. 92/2012. Nella decisione in commento la Corte ha altresì modo di dare continuità all’orientamento per cui la fattispecie traslativa si perfeziona anche in presenza di un mero passaggio di personale in forza di obbligo contrattuale o di legge. Infatti se in un determinato appalto di servizi un imprenditore subentra ad un altro e ne acquisisce il personale e i beni strumentali organizzati (cioè l’azienda), la fattispecie no…
Modelling heat transfer-controlled cooling and freezing times: a comparison between computational values and experimental results
2013
Modelling of heat transfer-controlled cooling and freezing time predictions are very important for a good preservation of foodstuffs. In that regard, we used a computer code based on the finite-element method that allowed us to analyse the phase-change of various foodstuffs during their freezing. The model was exercised to predict process times. The results can be used to design high efficiency plants. In this work, the results predicted by the FEM program are compared with the experimental values given in technical literature.
Experimental and numerical study of composite T-joints for marine application
2010
Abstract The aim of this work was to study the behaviour of composite T-joints used in marine applications. The effect of several parameters was investigated. In particular, three configurations were studied; i.e. with adhesive and with two different over-laminations. Moreover, the joined sections were made of different materials. These joints were subjected to a tensile load in the plane of the sheet. To quantify the effect of different designs on the strength, a variance analysis was performed. Finally, a numerical model was developed using a commercial finite element code (Ansys).
Kerr self-cleaning of pulsed beam in an ytterbium doped multimode fiber
2017
International audience; We experimentally demonstrate that Kerr spatial self-cleaning of a pulsed beam can be obtained in an amplifying multimode optical fiber. An input peak power of 500 W only was sufficient to produce a quasi-single-mode emission from the double-clad ytterbium doped multimode fiber (YMMF) with non-parabolic refractive index profile. We compare the self-cleaning behavior observed in the same fiber with loss and with gain. Laser gain introduces new opportunities to achieve spatial self-cleaning of light in multimode fibers at a relatively low power threshold.
The pure descent statistic on permutations
2017
International audience; We introduce a new statistic based on permutation descents which has a distribution given by the Stirling numbers of the first kind, i.e., with the same distribution as for the number of cycles in permutations. We study this statistic on the sets of permutations avoiding one pattern of length three by giving bivariate generating functions. As a consequence, new classes of permutations enumerated by the Motzkin numbers are obtained. Finally, we deduce results about the popularity of the pure descents in all these restricted sets. (C) 2017 Elsevier B.V. All rights reserved.
Hyperfine Paschen-Back regime realized in Rb nanocell
2012
A simple and efficient scheme based on one-dimensional nanometric thin cell filled with Rb and strong permanent ring magnets allowed direct observation of hyperfine Paschen-Back regime on D1 line in 0.5 - 0.7 T magnetic field. Experimental results are perfectly consistent with the theory. In particular, with sigma+ laser excitation, the slopes of B-field dependence of frequency shift for all the 10 individual transitions of 85,87Rb are the same and equal to 18.6 MHz/mT. Possible applications for magnetometry with submicron spatial resolution and tunable atomic frequency references are discussed.
Embedded multi-spectral image processing for real-time medical application
2016
International audience; The newly introduced Kubelka-Munk Genetic Algorithm (KMGA) is a promising technique for the assessment of skin lesions from multi-spectral images. Using five skin parameter maps such as concentration or epidermis/dermis thickness, this method combines the Kubelka-Munk Light-Tissue interaction model and Genetic Algorithm optimization process to produce a quantitative measure of cutaneous tissue. Up to the present, variant improved KMGA implementations have been successfully realized using the recent parallel computing techniques. However, all these achievements are based on the multi-core CPUs. This results in a quite high cost and low practicability for the hardware …
Whole mirror duplication-random loss model and pattern avoiding permutations
2010
International audience; In this paper we study the problem of the whole mirror duplication-random loss model in terms of pattern avoiding permutations. We prove that the class of permutations obtained with this model after a given number p of duplications of the identity is the class of permutations avoiding the alternating permutations of length p2+1. We also compute the number of duplications necessary and sufficient to obtain any permutation of length n. We provide two efficient algorithms to reconstitute a possible scenario of whole mirror duplications from identity to any permutation of length n. One of them uses the well-known binary reflected Gray code (Gray, 1953). Other relative mo…
Presentations of constrained systems with unconstrained positions
2005
International audience; We give a polynomial-time construction of the set of sequences that satisfy a finite-memory constraint defined by a finite list of forbidden blocks, with a specified set of bit positions unconstrained. Such a construction can be used to build modulation/error-correction codes (ECC codes) like the ones defined by the Immink-Wijngaarden scheme in which certain bit positions are reserved for ECC parity. We give a lineartime construction of a finite-state presentation of a constrained system defined by a periodic list of forbidden blocks. These systems, called periodic-finite-type systems, were introduced by Moision and Siegel. Finally, we present a linear-time algorithm for con…