Asymmetrically fair rules for an indivisible good problem with a budget constraint

We study a particular restitution problem where there is an indivisible good (land or property) over which two agents have rights: the dispossessed agent and the owner. A third party, possibly the government, seeks to resolve the situation by assigning rights to one and compensate the other. There is also a maximum amount of money available for the compensation. We characterize a family of asymmetrically fair rules that are immune to strategic behavior, guarantee minimal welfare levels for the agents, and satisfy the budget constraint.

Constraint handling rules. Compositional semantics and program transformation

This thesis intends to investigate two aspects of Constraint Handling Rules (CHR). It proposes a compositional semantics and a technique for program transformation. CHR is a concurrent committed-choice constraint logic programming language consisting of guarded rules, which transform multi-sets of atomic formulas (constraints) into simpler ones until exhaustion [Frü06] and it belongs to the declarative languages family. It was initially designed for writing constraint solvers but it has recently also proven to be a general purpose language, being as it is Turing equivalent [SSD05a]. Compositionality is the first CHR aspect to be considered. A trace based compositional semantics for CHR was previously defined in [DGM05]. The reference operational semantics for such a compositional model was the original operational semantics for CHR which, due to the propagation rule, admits trivial non-termination. In this thesis we extend the work of [DGM05] by introducing a more refined trace based compositional semantics which also includes the history. The use of history is a well-known technique in CHR which permits us to trace the application of propagation rules and consequently it permits trivial non-termination avoidance [Abd97, DSGdlBH04]. Naturally, the reference operational semantics, of our new compositional one, uses history to avoid trivial non-termination too. Program transformation is the second CHR aspect to be considered, with particular regard to the unfolding technique. Said technique is an appealing approach which allows us to optimize a given program and in more detail to improve run-time efficiency or spaceconsumption. Essentially it consists of a sequence of syntactic program manipulations which preserve a kind of semantic equivalence called qualified answer [Frü98], between the original program and the transformed ones. The unfolding technique is one of the basic operations which is used by most program transformation systems. It consists in the replacement of a procedure-call by its definition. In CHR every conjunction of constraints can be considered as a procedure-call, every CHR rule can be considered as a procedure and the body of said rule represents the definition of the call. While there is a large body of literature on transformation and unfolding of sequential programs, very few papers have addressed this issue for concurrent languages. We define an unfolding rule, show its correctness and discuss some conditions in which it can be used to delete an unfolded rule while preserving the meaning of the original program. Finally, confluence and termination maintenance between the original and transformed programs are shown. This thesis is organized in the following manner. Chapter 1 gives some general notion about CHR. Section 1.1 outlines the history of programming languages with particular attention to CHR and related languages. Then, Section 1.2 introduces CHR using examples. Section 1.3 gives some preliminaries which will be used during the thesis. Subsequentely, Section 1.4 introduces the syntax and the operational and declarative semantics for the first CHR language proposed. Finally, the methodologies to solve the problem of trivial non-termination related to propagation rules are discussed in Section 1.5. Chapter 2 introduces a compositional semantics for CHR where the propagation rules are considered. In particular, Section 2.1 contains the definition of the semantics. Hence, Section 2.2 presents the compositionality results. Afterwards Section 2.3 expounds upon the correctness results. Chapter 3 presents a particular program transformation known as unfolding. This transformation needs a particular syntax called annotated which is introduced in Section 3.1 and its related modified operational semantics !0t is presented in Section 3.2. Subsequently, Section 3.3 defines the unfolding rule and prove its correctness. Then, in Section 3.4 the problems related to the replacement of a rule by its unfolded version are discussed and this in turn gives a correctness condition which holds for a specific class of rules. Section 3.5 proves that confluence and termination are preserved by the program modifications introduced. Finally, Chapter 4 concludes by discussing related works and directions for future work.

CLP Projection for Constraint Handling Rules

This paper introduces and studies the notion of CLP projection for Constraint Handling Rules (CHR). The CLP projection consists of a naive translation of CHR programs into Constraint Logic Programs (CLP). We show that the CLP projection provides a safe operational and declarative approximation for CHR programs. We demónstrate moreover that a confluent CHR program has a least model, which is precisely equal to the least model of its CLP projection (closing henee a ten year-old conjecture by Abdenader et al.). Finally, we illustrate how the notion of CLP projection can be used in practice to apply CLP analyzers to CHR. In particular, we show results from applying AProVE to prove termination, and CiaoPP to infer both complexity upper bounds and types for CHR programs.

Constraint solving over multi-valued logics - application to digital circuits

Due to usage conditions, hazardous environments or intentional causes, physical and virtual systems are subject to faults in their components, which may affect their overall behaviour. In a ‘black-box’ agent modelled by a set of propositional logic rules, in which just a subset of components is externally visible, such faults may only be recognised by examining some output function of the agent. A (fault-free) model of the agent’s system provides the expected output given some input. If the real output differs from that predicted output, then the system is faulty. However, some faults may only become apparent in the system output when appropriate inputs are given. A number of problems regarding both testing and diagnosis thus arise, such as testing a fault, testing the whole system, finding possible faults and differentiating them to locate the correct one. The corresponding optimisation problems of finding solutions that require minimum resources are also very relevant in industry, as is minimal diagnosis. In this dissertation we use a well established set of benchmark circuits to address such diagnostic related problems and propose and develop models with different logics that we formalise and generalise as much as possible. We also prove that all techniques generalise to agents and to multiple faults. The developed multi-valued logics extend the usual Boolean logic (suitable for faultfree models) by encoding values with some dependency (usually on faults). Such logics thus allow modelling an arbitrary number of diagnostic theories. Each problem is subsequently solved with CLP solvers that we implement and discuss, together with a new efficient search technique that we present. We compare our results with other approaches such as SAT (that require substantial duplication of circuits), showing the effectiveness of constraints over multi-valued logics, and also the adequacy of a general set constraint solver (with special inferences over set functions such as cardinality) on other problems. In addition, for an optimisation problem, we integrate local search with a constructive approach (branch-and-bound) using a variety of logics to improve an existing efficient tool based on SAT and ILP.

Joint dynamic probabilistic constraints with projected linear decision rules

We consider multistage stochastic linear optimization problems combining joint dynamic probabilistic constraints with hard constraints. We develop a method for projecting decision rules onto hard constraints of wait-and-see type. We establish the relation between the original (in nite dimensional) problem and approximating problems working with projections from di erent subclasses of decision policies. Considering the subclass of linear decision rules and a generalized linear model for the underlying stochastic process with noises that are Gaussian or truncated Gaussian, we show that the value and gradient of the objective and constraint functions of the approximating problems can be computed analytically.

Auxin And Physical Constraint Exerted By The Perianth Promote Androgynophore Bending In Passiflora Mucronata L. (passifloraceae).

The androgynophore column, a distinctive floral feature in passion flowers, is strongly crooked or bent in many Passiflora species pollinated by bats. This is a floral feature that facilitates the adaptation to bat pollination. Crooking or bending of plant organs are generally caused by environmental stimulus (e.g. mechanical barriers) and might involve the differential distribution of auxin. Our aim was to study the role of the perianth organs and the effect of auxin in bending of the androgynophore of the bat-pollinated species Passiflora mucronata. Morpho-anatomical characterisation of the androgynophore, including measurements of curvature angles and cell sizes both at the dorsal (convex) and ventral (concave) sides of the androgynophore, was performed on control flowers, flowers from which perianth organs were partially removed and flowers treated either with auxin (2,4-dichlorophenoxyacetic acid; 2,4-D) or with an inhibitor of auxin polar transport (naphthylphthalamic acid; NPA). Asymmetric growth of the androgynophore column, leading to bending, occurs at a late stage of flower development. Removing the physical constraint exerted by perianth organs or treatment with NPA significantly reduced androgynophore bending. Additionally, the androgynophores of plants treated with 2,4-D were more curved when compared to controls. There was a larger cellular expansion at the dorsal side of the androgynophores of plants treated with 2,4-D and in both sides of the androgynophores of plants treated with NPA. This study suggests that the physical constraint exerted by perianth and auxin redistribution promotes androgynophore bending in P. mucronata and might be related to the evolution of chiropterophily in the genus Passiflora.

A FIRST CONSTRAINT ON THE THICK DISK SCALE LENGTH: DIFFERENTIAL RADIAL ABUNDANCES IN K GIANTS AT GALACTOCENTRIC RADII 4, 8, AND 12 kpc

Based on high-resolution spectra obtained with the MIKE spectrograph on the Magellan telescopes, we present detailed elemental abundances for 20 red giant stars in the outer Galactic disk, located at Galactocentric distances between 9 and 13 kpc. The outer disk sample is complemented with samples of red giants from the inner Galactic disk and the solar neighborhood, analyzed using identical methods. For Galactocentric distances beyond 10 kpc, we only find chemical patterns associated with the local thin disk, even for stars far above the Galactic plane. Our results show that the relative densities of the thick and thin disks are dramatically different from the solar neighborhood, and we therefore suggest that the radial scale length of the thick disk is much shorter than that of the thin disk. We make a first estimate of the thick disk scale length of L(thick) = 2.0 kpc, assuming L(thin) = 3.8 kpc for the thin disk. We suggest that radial migration may explain the lack of radial age, metallicity, and abundance gradients in the thick disk, possibly also explaining the link between the thick disk and the metal-poor bulge.

Radiative decay of the X(3872) as a mixed molecule-charmonium state in QCD sum rules

We use QCD sum rules (QCDSR) to calculate the width of the radiative decay of the meson X(3872), assumed to be a mixture between charmonium and exotic molecular [c (q) over bar][q (c) over bar] states with J(PC) = 1(++). We find that in a small range for the values of the mixing angle, 5 degrees <= theta <= 13 degrees, we get the branching ratio Gamma(X -> J/psi gamma)/Gamma(X -> J/psi pi(+)pi(-)) = 0.19 +/- 0.13, which is in agreement, with the experimental value. This result is compatible with the analysis of the mass and decay width of the mode J/psi(n pi) performed in the same approach.

Bs0 meson and the Bs0BK coupling from QCD sum rules

We evaluate the mass of the B(s0) scalar meson and the coupling constant in the B(s0)BK vertex in the framework of QCD sum rules. We consider the B(s0) as a tetraquark state to evaluate its mass. We get m(Bs0) = (5.85 +/- 0.13) GeV, which is in agreement, considering the uncertainties, with predictions supposing it as a b (s) over bar state or a B (K) over bar bound state with J(P) = 0(+). To evaluate the g(Bs0BK) coupling, we use the three-point correlation functions of the vertex, considering B(s0) as a normal b (s) over bar state. The obtained coupling constant is: g(Bs0BK) = (16.3 +/- 3.2) GeV. This number is in agreement with light-cone QCD sum rules calculation. We have also compared the decay width of the B(s0) -> BK process considering the B(s0) to be a b (s) over bar state and a BK molecular state. The width obtained for the BK molecular state is twice as big as the width obtained for the b (s) over bar state. Therefore, we conclude that with the knowledge of the mass and the decay width of the B(s0) meson, one can discriminate between the different theoretical proposals for its structure.

QCD sum rules for the X(3872) as a mixed molecule-charmonium state

We use QCD sum rules to test the nature of the meson X(3872), assumed to be a mixture between charmonium and exotic molecular [c (q) over bar][q (c) over bar] states with J(PC) = 1(++). We find that there is only a small range for the values of the mixing angle theta that can provide simultaneously good agreement with the experimental value of the mass and the decay width, and this range is 5(0) <= theta <= 3(0). In this range we get m(X) = (3.77 +/- 0.18) GeV and Gamma(X -> J/psi pi(+)pi(-)) = (9.3 +/- 6.9) MeV, which are compatible, within the errors, with the experimental values. We, therefore, conclude that the X(3872) is approximately 97% a charmonium state with 3% admixture of similar to 88% D(0)D*(0) molecule and similar to 12% D(+)D*(-) molecule.

Width of exotics from QCD sum rules : Tetraquarks or molecules?

We investigate the widths of the recently observed charmonium like resonances X(3872), Z(4430), and Z(2)(4250) using QCD sum rules. Extending previous analyses regarding these states as diquark-antiquark states or molecules of D mesons, we introduce the Breit-Wigner function in the pole term. We find that introducing the width increases the mass at the small Borel window region. Using the operator-product expansion up to dimension 8, we find that the sum rules based on interpolating current with molecular components give a stable Borel curve from which both the masses and widths of these resonances can be well obtained. Thus the QCD sum rule approach strongly favors the molecular description of these states.

Bayesian updating rules in continuous opinion dynamics models

Here, I investigate the use of Bayesian updating rules applied to modeling how social agents change their minds in the case of continuous opinion models. Given another agent statement about the continuous value of a variable, we will see that interesting dynamics emerge when an agent assigns a likelihood to that value that is a mixture of a Gaussian and a uniform distribution. This represents the idea that the other agent might have no idea about what is being talked about. The effect of updating only the first moments of the distribution will be studied, and we will see that this generates results similar to those of the bounded confidence models. On also updating the second moment, several different opinions always survive in the long run, as agents become more stubborn with time. However, depending on the probability of error and initial uncertainty, those opinions might be clustered around a central value.

On the functional integration between postural and supra-postural tasks on the basis of contextual cues and task constraint

In order to evaluate the effects of uncertainty about direction of mechanical perturbation and supra-postural task constraint on postural control young adults had their upright stance perturbed while holding a tray in a horizontal position Stance was perturbed by moving forward or backward a supporting platform contrasting situations of certainty versus uncertainty of direction of displacement Increased constraint on postural stability was Imposed by a supra-postural task of equilibrating a cylinder on the tray Performance was assessed through EMG of anterior leg muscles angular displacement of the main Joints involved in the postural reactions and displacement of the tray Results showed that both certainty on the direction of perturbation and Increased supra-postural task constraint led to decreased angular displacement of the knee and the hip Furthermore combination of certainty and high supra-postural task constraint produced shorter latency of muscular activation Such postural responses were paralleled by decreased displacement of the tray Thesi results suggest a functional integration between the tasks with central set priming reactive postural responses from contextual cues and Increased stability demand (C) 2010 Elsevier B V All rights reserved

Financial distress, financial constraint and investment decision: Evidence from Brazil

This paper analyses the presence of financial constraint in the investment decisions of 367 Brazilian firms from 1997 to 2004, using a Bayesian econometric model with group-varying parameters. The motivation for this paper is the use of clustering techniques to group firms in a totally endogenous form. In order to classify the firms we used a hybrid clustering method, that is, hierarchical and non-hierarchical clustering techniques jointly. To estimate the parameters a Bayesian approach was considered. Prior distributions were assumed for the parameters, classifying the model in random or fixed effects. Ordinate predictive density criterion was used to select the model providing a better prediction. We tested thirty models and the better prediction considers the presence of 2 groups in the sample, assuming the fixed effect model with a Student t distribution with 20 degrees of freedom for the error. The results indicate robustness in the identification of financial constraint when the firms are classified by the clustering techniques. (C) 2010 Elsevier B.V. All rights reserved.