Search results for "Olea"

Efficient CNF Encoding of Boolean Cardinality Constraints

2003

In this paper, we address the encoding into CNF clauses of Boolean cardinality constraints that arise in many practical applications. The proposed encoding is efficient with respect to unit propagation, which is implemented in almost all complete CNF satisfiability solvers. We prove the practical efficiency of this encoding on some problems arising in discrete tomography that involve many cardinality constraints. This encoding is also used together with a trivial variable elimination in order to re-encode parity learning benchmarks so that a simple Davis and Putnam procedure can solve them.

Distributed Leadership for Interconnected Worlds

2011

The technological advancements in the second half of the previous century generated the potential for participatory decision making in organizational and governmental institutions. Moreover, the digital networking environments on the Internet that enabled this type of decision making were accompanied by the emergence and establishment of on-line communities. Under this perspective, the range of communication mediated by ubiquitous computing allows problems, ideas, and suggestions of a spec ific nature to be considered when gathered into organizational and institutional virtual spaces. Within these spaces, the voices of individual customers, workers, organizational stakeholders, and/or citiz…

Some morphological, anatomical, physiological responses of different olive cultivars to high temperatures and drought stress

2004

The aim of this work is to find relationships between morphology and physiology in three different olive cultivars: Biancolilla, Cerasuola and Nocellara del Belice, when plants were subjected to high temperature and drought. These cultivars are estensively used in Sicily for productive purposes. The results about ultrastructural and physiological studies on shoot growth, leaf anatomy, chloroplast ultrastructure and oxygen production, indicate that Biancolilla is the cultivar in which the studied traits showed fewer changes and can be considered to have the best tolerance to both high temperatures and water deficit. In the other hand, the morphological and physiological characteristics studi…

Sustained Late Branch Patency and Low Incidence of Persistent Type Ia Endoleaks Following Snorkel/chimney EVAR Shown in the Updated PERICLES Registry

2016

The Bioshale Project: Search for a Sustainable Way of Exploiting Black Shale Ores Using Biotechnology

2007

The Bioshale project, involving 13 partners throughout Europe, is co-funded by the European Commission under the FP6 program. The main objective of this project (which started in October 2004) is to identify and develop innovative biotechnological processes for ‘’eco-efficient’’ exploitation of metal-rich, black shale ores. Three extensive deposits have been selected for R&D actions. These are: (i) a site (in Talvivaara, Finland) that, at the outset of the project, had not been exploited; (ii) a deposit (in Lubin, Poland) that is currently being actively mined, and (iii) a third site (in Mansfeld, Germany) where the ore had been actively mined in the past, but which is no longer exploit…

Two new biologically active triterpenoidal saponins acylated with salicylic acid from Albizia adianthifolia

2003

International audience; Two new oleanane-type triterpene saponins, adianthifoliosides A (1) and B (2), were isolated from a 95% ethanolic extract of roots of Albizia adianthifolia. Their structures were elucidated mainly by using a combination of 600 MHz 1D and 2D NMR techniques (COSY, NOESY, TOCSY, HSQC, and HMBC) and by FABMS and HRESIMS. Compounds 1 and 2 were characterized as glycosides of acacic acid acylated by an o-hydroxybenzoyl unit. The crude saponin mixture (CSM), compounds 1 and 2 together with 3 and 4 (prosapogenins obtained from the mild alkaline hydrolysate of the CSM), were evaluated for immunomodulatory activity on the Jurkat T cell line and for hemolytic property against s…

Inclusion ratio based estimator for the mean length of the boolean line segment model with an application to nanocrystalline cellulose

2014

A novel estimator for estimating the mean length of fibres is proposed for censored data observed in square shaped windows. Instead of observing the fibre lengths, we observe the ratio between the intensity estimates of minus-sampling and plus-sampling. It is well-known that both intensity estimators are biased. In the current work, we derive the ratio of these biases as a function of the mean length assuming a Boolean line segment model with exponentially distributed lengths and uniformly distributed directions. Having the observed ratio of the intensity estimators, the inverse of the derived function is suggested as a new estimator for the mean length. For this estimator, an approximation…

Topological Logics with Connectedness over Euclidean Spaces

2013

We consider the quantifier-free languages, Bc and Bc °, obtained by augmenting the signature of Boolean algebras with a unary predicate representing, respectively, the property of being connected, and the property of having a connected interior. These languages are interpreted over the regular closed sets of R n ( n ≥ 2) and, additionally, over the regular closed semilinear sets of R n . The resulting logics are examples of formalisms that have recently been proposed in the Artificial Intelligence literature under the rubric Qualitative Spatial Reasoning. We prove that the satisfiability problem for Bc is undecidable over the regular closed semilinear sets in all dimensions greater than 1,…

Functions definable by numerical set-expressions

2011

A "numerical set-expression" is a term specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. If these operations are confined to the usual Boolean operations together with the result of lifting addition to the level of sets, we speak of "additive circuits". If they are confined to the usual Boolean operations together with the result of lifting addition and multiplication to the level of sets, we speak of "arithmetic circuits". In this paper, we investigate the definability of sets and functions by means of additive and arithmetic circuits, occasionally augmented with additional operations.

Optimal one-shot quantum algorithm for EQUALITY and AND

2017

We study the computation complexity of Boolean functions in the quantum black box model. In this model our task is to compute a function $f:\{0,1\}\to\{0,1\}$ on an input $x\in\{0,1\}^n$ that can be accessed by querying the black box. Quantum algorithms are inherently probabilistic; we are interested in the lowest possible probability that the algorithm outputs incorrect answer (the error probability) for a fixed number of queries. We show that the lowest possible error probability for $AND_n$ and $EQUALITY_{n+1}$ is $1/2-n/(n^2+1)$.