Search results for "DDE"
showing 10 items of 1858 documents
The contribution of geographical certification programs to farm income and rural economies: The case of Pecorino Siciliano PDO
2021
This study attempts to measure the capacity of the EU geographical certification scheme to positively influence the price of certified products and the incomes of their producers. A comparison of the economic results of two cheese-producing dairy farm enterprises with different business strategies and locations within the Sicilian hinterlands is performed in order to determine the transformation value of each dairy’s sheep milk into pecorino cheese (with and without the Protected Designation of Origin, or PDO, certification) and the related joint products (ricotta). The economic convenience of the total transformation of sheep milk into Pecorino Siciliano PDO and ricotta is also appraised. …
An efficient VM-based software protection
2011
This paper presents Truly-protect, a system, incorporating a virtual machine, that enables execution of encrypted programs. Our intention is to form a framework for a conditional access/digital rights management system.
HIGH-ORDER ACCURATE EMBEDDED-BOUNDARY DISCONTINUOUS GALERKIN METHODS FOR INVISCID GAS DYNAMICS
2022
This work presents a computational framework for solving the equations of inviscid gas dynamics over embedded geometries based on the discontinuous Galerkin (DG) method. The novelty of the framework is the ability to achieve high-order accuracy in the regions of smooth flow and to handle the presence of solution discontinuities via suitably introduced damping terms, which allow controlling spurious oscillations that are typical of high-order methods for first-order hyperbolic PDEs. The framework employs block structured Cartesian grids where a level set function defines implicitly the considered geometry. The domain is partitioned by intersecting the grid and the level set function, such th…
Restricted 123-avoiding Baxter permutations and the Padovan numbers
2007
AbstractBaxter studied a particular class of permutations by considering fixed points of the composite of commuting functions. This class is called Baxter permutations. In this paper we investigate the number of 123-avoiding Baxter permutations of length n that also avoid (or contain a prescribed number of occurrences of) another certain pattern of length k. In several interesting cases the generating function depends only on k and is expressed via the generating function for the Padovan numbers.
Automata and differentiable words
2011
We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this construction to the case of C\infinity-words, i.e., words differentiable arbitrary many times. We thus obtain an infinite automaton for representing the set of C\infinity-words. We derive a classification of C\infinity-words induced by the structure of the automaton. Then, we introduce a new framework for dealing with \infinity-words, based on a three letter alphabet. This allows us to define a compacted version of the automaton, that we use to prove that ev…
The support localization property of the strongly embedded subspaces of banach function spaces
2015
[EN] Motivated by the well known Kadec-Pelczynski disjointifcation theorem, we undertake an analysis of the supports of non-zero functions in strongly embedded subspaces of Banach functions spaces. The main aim is to isolate those properties that bring additional information on strongly embedded subspaces. This is the case of the support localization property, which is a necessary condition fulflled by all strongly embedded subspaces. Several examples that involve Rademacher functions, the Volterra operator, Lorentz spaces or Orlicz spaces are provided.
Quantum Pushdown Automata
2000
Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [13]. In this paper we introduce the notion of quantum pushdown automata (QPA) in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [11]. It is established that the unitarity criteria of QPA are not equivalent to the corresponding unitarity criteria of quantum Turing machines [4]. We show that QPA can recognize every regular language. Finally we present some simple languages recognized by QPA, two of them are not recognizable by deterministic pushdown automata and one seems to be not recognizable by probabilistic pushdown …
Graph languages defined by systems of forbidden structures: A survey
1988
This paper deals with different ways of defining graph languages. These are the so-called forbidden structures. Some results on decision problems, their complexity, and set theoretic closure properties are scetched. A normal form, the minimal systems, are given. Finally the influence of the different kinds of forbidden structures on the descriptive power of the systems is shown.
Intracerebral Borna Disease Virus Infection of Bank Voles Leading to Peripheral Spread and Reverse Transcription of Viral RNA
2011
Bornaviruses, which chronically infect many species, can cause severe neurological diseases in some animal species; their association with human neuropsychiatric disorders is, however, debatable. The epidemiology of Borna disease virus (BDV), as for other members of the family Bornaviridae, is largely unknown, although evidence exists for a reservoir in small mammals, for example bank voles (Myodes glareolus). In addition to the current exogenous infections and despite the fact that bornaviruses have an RNA genome, bornavirus sequences integrated into the genomes of several vertebrates millions of years ago. Our hypothesis is that the bank vole, a common wild rodent species in traditional B…
Direct solution of compensated radial distribution networks with constant impedance/current loads
2009
In this paper, a methodology to solve radial distribution networks, with constant current and/or impedance loads as well as shunt capacitor banks, is proposed. The techniques currently available to solve such systems are based either on iterative methods or on the bus impedance matrix. In both cases, the elaboration times are quite high since these are related, for iterative methods, to the overall number of iterations, and, for those methods based on the impedance matrix, to the inversion of the admittance matrix. The method developed here is the extension of a technique that is valid to solve networks made of impedances with one supply point. The methodology can also be applied in the sol…