Search results for " programmi"
showing 10 items of 1629 documents
Improving Interpolants for Linear Arithmetic
2015
Craig interpolation for satisfiability modulo theory formulas have come more into focus for applications of formal verification. In this paper we, introduce a method to reduce the size of linear constraints used in the description of already computed interpolant in the theory of linear arithmetic with respect to the number of linear constraints. We successfully improve interpolants by combining satisfiability modulo theory and linear programming in a local search heuristic. Our experimental results suggest a lower running time and a larger reduction compared to other methods from the literature.
Elliptic convolution operators on non-quasianalytic classes
2001
For those nonquasianalytic classes in which an extension of the classical Borel's theorem holds we show that every elliptic convolution operator is the composition of a translation and an invertible ultradifferential operator. This answers a question asked by Chou in: La transformation de Fourier complexe et l'equation de convolution, LNM 325, Berlin-Heidelberg-New York (1973).
Ancestral Reconstruction and Investigations of Genomic Recombination on some Pentapetalae Chloroplasts
2019
Abstract In this article, we propose a semi-automated method to rebuild genome ancestors of chloroplasts by taking into account gene duplication. Two methods have been used in order to achieve this work: a naked eye investigation using homemade scripts, whose results are considered as a basis of knowledge, and a dynamic programming based approach similar to Needleman-Wunsch. The latter fundamentally uses the Gestalt pattern matching method of sequence matcher to evaluate the occurrences probability of each gene in the last common ancestor of two given genomes. The two approaches have been applied on chloroplastic genomes from Apiales, Asterales, and Fabids orders, the latter belonging to Pe…
Programmi di clemenza e azione risarcitoria: convivenza possibile?
2014
This work stems from the European Directive on antitrust damages actions and enquires on the need to preserve the effectiveness of antitrust public and private enforcement within the framework of the relationship between the leniency programmes and actions for damages. As is well known, the leniency programmes allow companies involved in an agreement prohibited by competition law to cooperate with competent Antitrust Authority in order to disclose such an infringement and obtain the immunity or a reduction from fines. This generates the need to preserve the secrecy of leniency statements in order to not deter companies from using such a programme. The Directive provides, inter alia, that na…
L'Autorità garante della concorrenza e del mercato ei prgrammi di clemenza
2010
A distanza di tre anni dall'introduzione dei programmi di clemenza nella legge antitrust italiana, si impone una riflessione sui problemi aperti dalla loro adozione e applicazione. Il contributo li esamina, comparando il sistema italiano con quello comunitario e con gli altri sistemi vigenti nell'ambito dell'ECN. Evidenzia, quindi, alcuni aspetti critici della disciplina italiana, relativi all'accesso dei terzi alle dichiarazioni confessorie e alla documentazione allegata.
Scenario optimization asset and liability modelling for individual investors
2006
We develop a scenario optimization model for asset and liability management of individual investors. The individual has a given level of initial wealth and a target goal to be reached within some time horizon. The individual must determine an asset allocation strategy so that the portfolio growth rate will be sufficient to reach the target. A scenario optimization model is formulated which maximizes the upside potential of the portfolio, with limits on the downside risk. Both upside and downside are measured vis- `a-vis the goal. The stochastic behavior of asset returns is captured through bootstrap simulation, and the simulation is embedded in the model to determine the optimal portfolio. …
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…
The factorization method for real elliptic problems
2006
The Factorization Method localizes inclusions inside a body from mea- surements on its surface. Without a priori knowing the physical parameters inside the inclusions, the points belonging to them can be characterized using the range of an auxiliary operator. The method relies on a range characterization that relates the range of the auxiliary operator to the measurements and is only known for very particular applications. In this work we develop a general framework for the method by considering sym- metric and coercive operators between abstract Hilbert spaces. We show that the important range characterization holds if the difference between the inclusions and the background medium satisfi…
External labeling and algorithms for hierarchic networks
1988
Algorithms for generating internal data structures for networks are given. Data bases for networks can be partitioned hierarchically. Nodes of lower class networks may also be in the interior of a higher class arc which will be split if it is included into the final network. Naming is based either on nodes or on arcs.
A comparison of two different formulations for Arc Routing Problems on Mixed graphs
2006
[EN] Arc routing problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing its traversal in the corresponding direction. In this paper, and using the mixed general routing problem as an example, we compare theoretical and computationally both formulations as well as the lower bounds obtained from them using Linear Programming based methods. Extensive computational experiments, including some big and newly generated random instances, are presented.