The effect of acute magnesium loading on the maximal exercise performance of stable chronic obstructive pulmonary disease patients

OBJECTIVE: The potential influence of magnesium on exercise performance is a subject of increasing interest. Magnesium has been shown to have bronchodilatatory properties in asthma and chronic obstructive pulmonary disease patients. The aim of this study was to investigate the effects of acute magnesium IV loading on the aerobic exercise performance of stable chronic obstructive pulmonary disease patients. METHODS: Twenty male chronic obstructive pulmonary disease patients (66.2 +/- 8.3 years old, FEV1: 49.3 +/- 19.8%) received an IV infusion of 2 g of either magnesium sulfate or saline on two randomly assigned occasions approximately two days apart. Spirometry was performed both before and 45 minutes after the infusions. A symptom-limited incremental maximal cardiopulmonary test was performed on a cycle ergometer at approximately 100 minutes after the end of the infusion. ClinicalTrials.gov: NCT00500864 RESULTS: Magnesium infusion was associated with significant reductions in the functional residual capacity (-0.41 l) and residual volume (-0.47 l), the mean arterial blood pressure (-5.6 mmHg) and the cardiac double product (734.8 mmHg.bpm) at rest. Magnesium treatment led to significant increases in the maximal load reached (+8 w) and the respiratory exchange ratio (0.06) at peak exercise. The subgroup of patients who showed increases in the work load equal to or greater than 5 w also exhibited significantly greater improvements in inspiratory capacity (0.29 l). CONCLUSIONS: The acute IV loading of magnesium promotes a reduction in static lung hyperinflation and improves the exercise performance in stable chronic obstructive pulmonary disease patients. Improvements in respiratory mechanics appear to be responsible for the latter finding.

TWO NEW WEAK CONSTRAINT QUALIFICATIONS AND APPLICATIONS

We present two new constraint qualifications (CQs) that are weaker than the recently introduced relaxed constant positive linear dependence (RCPLD) CQ. RCPLD is based on the assumption that many subsets of the gradients of the active constraints preserve positive linear dependence locally. A major open question was to identify the exact set of gradients whose properties had to be preserved locally and that would still work as a CQ. This is done in the first new CQ, which we call the constant rank of the subspace component (CRSC) CQ. This new CQ also preserves many of the good properties of RCPLD, such as local stability and the validity of an error bound. We also introduce an even weaker CQ, called the constant positive generator (CPG), which can replace RCPLD in the analysis of the global convergence of algorithms. We close this work by extending convergence results of algorithms belonging to all the main classes of nonlinear optimization methods: sequential quadratic programming, augmented Lagrangians, interior point algorithms, and inexact restoration.

No-pole condition in Landau gauge: Properties of the Gribov ghost form factor and a constraint on the 2d gluon propagator

We study general properties of the Landau-gauge Gribov ghost form factor sigma(p(2)) for SU(N-c) Yang-Mills theories in the d-dimensional case. We find a qualitatively different behavior for d = 3, 4 with respect to the d = 2 case. In particular, considering any (sufficiently regular) gluon propagator D(p(2)) and the one-loop-corrected ghost propagator, we prove in the 2d case that the function sigma(p(2)) blows up in the infrared limit p -> 0 as -D(0) ln(p(2)). Thus, for d = 2, the no-pole condition sigma(p(2)) < 1 (for p(2) > 0) can be satisfied only if the gluon propagator vanishes at zero momentum, that is, D(0) = 0. On the contrary, in d = 3 and 4, sigma(p(2)) is finite also if D(0) > 0. The same results are obtained by evaluating the ghost propagator G(p(2)) explicitly at one loop, using fitting forms for D(p(2)) that describe well the numerical data of the gluon propagator in two, three and four space-time dimensions in the SU(2) case. These evaluations also show that, if one considers the coupling constant g(2) as a free parameter, the ghost propagator admits a one-parameter family of behaviors (labeled by g(2)), in agreement with previous works by Boucaud et al. In this case the condition sigma(0) <= 1 implies g(2) <= g(c)(2), where g(c)(2) is a "critical" value. Moreover, a freelike ghost propagator in the infrared limit is obtained for any value of g(2) smaller than g(c)(2), while for g(2) = g(c)(2) one finds an infrared-enhanced ghost propagator. Finally, we analyze the Dyson-Schwinger equation for sigma(p(2)) and show that, for infrared-finite ghost-gluon vertices, one can bound the ghost form factor sigma(p(2)). Using these bounds we find again that only in the d = 2 case does one need to impose D(0) = 0 in order to satisfy the no-pole condition. The d = 2 result is also supported by an analysis of the Dyson-Schwinger equation using a spectral representation for the ghost propagator. Thus, if the no-pole condition is imposed, solving the d = 2 Dyson-Schwinger equations cannot lead to a massive behavior for the gluon propagator. These results apply to any Gribov copy inside the so-called first Gribov horizon; i.e., the 2d result D(0) = 0 is not affected by Gribov noise. These findings are also in agreement with lattice data.

Implant Stability Measurements of Two Immediate Loading Protocols for the Edentulous Mandible: Rigid and Semi-rigid Splinting of the Implants

Aim: Primary and secondary stabilities of immediately loaded mandibular implants restored with fixed prostheses (FP) using rigid or semirigid splinting systems were clinically and radiographically evaluated. Methods: Fifteen edentulous patients were rehabilitated using hybrid FP; each had 5 implants placed between the mental foramens. Two groups were randomly divided: group 1-FP with the conventional rigid bar splinting the implants and group 2-semi-rigid cantilever extension system with titanium bars placed in the 2 distal abutment cylinders. Primary stability was evaluated using resonance frequency analysis after installation of the implant abutments. The measurements were made at 3 times: T0, at baseline; T1, 4 months after implant placement; and T2, 8 months after implant placement. Presence of mobility and inflammation in the implant surrounding regions were checked. Stability data were submitted to statistical analysis for comparison between groups (P, 0.05). Results: Implant survival rate for the implants was of 100% in both groups. No significant differences in the mean implant stability quotient values were found for both groups from baseline and after the 8-month follow-up. Conclusion: The immediate loading of the implants was satisfactory, and both splinting conditions (rigid and semi-rigid) can be successfully used for the restoration of edentulous mandibles. (Implant Dent 2012;21:486-490)

Constraint-based analysis of gene interactions using restricted boolean networks and time-series data

Abstract Background A popular model for gene regulatory networks is the Boolean network model. In this paper, we propose an algorithm to perform an analysis of gene regulatory interactions using the Boolean network model and time-series data. Actually, the Boolean network is restricted in the sense that only a subset of all possible Boolean functions are considered. We explore some mathematical properties of the restricted Boolean networks in order to avoid the full search approach. The problem is modeled as a Constraint Satisfaction Problem (CSP) and CSP techniques are used to solve it. Results We applied the proposed algorithm in two data sets. First, we used an artificial dataset obtained from a model for the budding yeast cell cycle. The second data set is derived from experiments performed using HeLa cells. The results show that some interactions can be fully or, at least, partially determined under the Boolean model considered. Conclusions The algorithm proposed can be used as a first step for detection of gene/protein interactions. It is able to infer gene relationships from time-series data of gene expression, and this inference process can be aided by a priori knowledge available.

The impact of healing time before loading on orthodontic mini-implant stability: a histomophometric study in minipigs

Objective: To evaluate healing time before loading, areas compression and tension and location of insertion on mini-implant stability. Design: Six minipigs were used. Each animal received 3 mini-implants in each quadrant: 1 mini-implant was used as an unloaded control (G1, n = 24); the other 2 were loaded with 150 g-force at three time intervals (G2: immediate loading, G3: after 15 days and G4: after 30 days), with 16 mini-implant in each experimental group. After 120 days, tissue blocks of the areas of interest were harvested. Clinical analysis (exact Fisher test) determined the survival rate. Histological analysis (Kontron KS 300TM, Zeiss) quantified the fractional bone-toimplant contact (%BIC) and bone area (%BA) at each healing time point, areas of interest, and insertion site (ANOVA and t tests for dependent and independent samples). Results: The mini-implant survival rates were G1: 71%, G2: 50%, G3: 75% and G4: 63%, with no statistical differences between them. The groups presented similar %BIC and %BA. There were no differences between the compression and tension sides or maxillary and mandibular insertion sites. Conclusions: These results suggest that low-intensity immediate or early orthodontic loading does not affect mini-implant stability, because similar histomorphometric results were observed for all the groups, with partial osseointegration of the mini-implants present.

The effect of CCL3 and CCR1 in bone remodeling induced by mechanical loading during orthodontic tooth movement in mice

Bone remodeling is affected by mechanical loading and inflammatory mediators, including chemokines. The chemokine (C–C motif) ligand 3 (CCL3) is involved in bone remodeling by binding to C–C chemokine receptors 1 and 5 (CCR1 and CCR5) expressed on osteoclasts and osteoblasts. Our group has previously demonstrated that CCR5 down-regulates mechanical loading-induced bone resorption. Thus, the present study aimed to investigate the role of CCR1 and CCL3 in bone remodeling induced by mechanical loading during orthodontic tooth movement in mice. Our results showed that bone remodeling was significantly decreased in CCL3−/− and CCR1−/− mice and in animals treated with Met-RANTES (an antagonist of CCR5 and CCR1). mRNA levels of receptor activator of nuclear factor kappa-B (RANK), its ligand RANKL, tumor necrosis factor alpha (TNF-α) and RANKL/osteoprotegerin (OPG) ratio were diminished in the periodontium of CCL3−/− mice and in the group treated with Met-RANTES. Met-RANTES treatment also reduced the levels of cathepsin K and metalloproteinase 13 (MMP13). The expression of the osteoblast markers runt-related transcription factor 2 (RUNX2) and periostin was decreased, while osteocalcin (OCN) was augmented in CCL3−/− and Met-RANTES-treated mice. Altogether, these findings show that CCR1 is pivotal for bone remodeling induced by mechanical loading during orthodontic tooth movement and these actions depend, at least in part, on CCL3.

Study of an anisotropic polymeric cellular material under compression loading

This paper emphasizes the influence of micro mechanisms of failure of a cellular material on its phenomenological response. Most of the applications of cellular materials comprise a compression loading. Thus, the study focuses on the influence of the anisotropy in the mechanical behavior of cellular material under cyclic compression loadings. For this study, a Digital Image Correlation (DIC) technique (named Correli) was applied, as well as SEM (Scanning Electron Microscopy) images were analyzed. The experimental results are discussed in detail for a closed-cell rigid poly (vinyl chloride) (PVC) foam, showing stress-strain curves in different directions and why the material can be assumed as transversely isotropic. Besides, the present paper shows elastic and plastic Poisson's ratios measured in different planes, explaining why the plastic Poisson's ratios approach to zero. Yield fronts created by the compression loadings in different directions and the influence of spring-back phenomenon on hardening curves are commented, also.

Effects of specimen geometry and loading mode on crack growth resistance curves of a high-strength pipeline girth weld

This work presents an investigation of the ductile tearing properties for a girth weld made of an API 5L X80 pipeline steel using experimentally measured crack growth resistance curves. Use of these materials is motivated by the increasing demand in the number of applications for manufacturing high strength pipes for the oil and gas industry including marine applications and steel catenary risers. Testing of the pipeline girth welds employed side-grooved, clamped SE(T) specimens and shallow crack bend SE(B) specimens with a weld centerline notch to determine the crack growth resistance curves based upon the unloading compliance (UC) method using the single specimen technique. Recently developed compliance functions and η-factors applicable for SE(T) and SE(B) fracture specimens with homogeneous material and overmatched welds are introduced to determine crack growth resistance data from laboratory measurements of load-displacement records.

Adaptation and Constraint in the Plant Reproductive Phase

Conservatism is a central theme of organismic evolution. Related species share characteristics due to their common ancestry. Some concern have been raised among evolutionary biologists, whether such conservatism is an expression of natural selection or of a constrained ability to adapt. This thesis explores adaptations and constraints within the plant reproductive phase, particularly in relation to the evolution of fleshy fruit types (berries, drupes, etc.) and the seasonal timing of flowering and fruiting. The different studies were arranged along a hierarchy of scale, with general data sets sampled among seed plants at the global scale, through more specific analyses of character evolution within the genus Rhamnus s.l. L. (Rhamnaceae), to descriptive and experimental field studies in a local population of Frangula alnus (Rhamnaceae). Apart from the field study, this thesis is mainly based on comparative methods explicitly incorporating phylogenetic relationships. The comparative study of Rhamnus s.l. species included the reconstruction of phylogenetic hypotheses based on DNA sequences. Among geographically overlapping sister clades, biotic pollination was not correlated with higher species richness when compared to wind pollinated plants. Among woody plants, clades characterized by fleshy fruit types were more species rich than their dry-fruited sister clades, suggesting that the fleshy fruit is a key innovation in woody habitats. Moreover, evolution of fleshy fruits was correlated with a change to more closed (darker) habitats. An independent contrast study within Rhamnus s.l. documented allometric relations between plant and fruit size. As a phylogenetic constraint, allometric effects must be considered weak or non-existent, though, as they did not prevail among different subclades within Rhamnus s.l. Fruit size was correlated with seed size and seed number in F. alnus. This thesis suggests that frugivore selection on fleshy fruit may be important by constraining the upper limits of fruit size, when a plant lineage is colonizing (darker) habitats where larger seed size is adaptive. Phenological correlations with fruit set, dispersal, and seed size in F. alnus, suggested that the evolution of reproductive phenology is constrained by trade-offs and partial interdependences between flowering, fruiting, dispersal, and recruitment phases. Phylogenetic constraints on the evolution of phenology were indicated by a lack of correlation between flowering time and seasonal length within Rhamnus cathartica and F. alnus, respectively. On the other hand, flowering time was correlated with seasonal length among Rhamnus s.l. species. Phenological differences between biotically and wind pollinated angiosperms also suggested adaptive change in reproductive phenology.

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.

Learning for scheduling a portfolio of constraint solvers

Nel lavoro di tesi qui presentato si indaga l'applicazione di tecniche di apprendimento mirate ad una più efficiente esecuzione di un portfolio di risolutore di vincoli (constraint solver). Un constraint solver è un programma che dato in input un problema di vincoli, elabora una soluzione mediante l'utilizzo di svariate tecniche. I problemi di vincoli sono altamente presenti nella vita reale. Esempi come l'organizzazione dei viaggi dei treni oppure la programmazione degli equipaggi di una compagnia aerea, sono tutti problemi di vincoli. Un problema di vincoli è formalizzato da un problema di soddisfacimento di vincoli(CSP). Un CSP è descritto da un insieme di variabili che possono assumere valori appartenenti ad uno specico dominio ed un insieme di vincoli che mettono in relazione variabili e valori assumibili da esse. Una tecnica per ottimizzare la risoluzione di tali problemi è quella suggerita da un approccio a portfolio. Tale tecnica, usata anche in am- biti come quelli economici, prevede la combinazione di più solver i quali assieme possono generare risultati migliori di un approccio a singolo solver. In questo lavoro ci preoccupiamo di creare una nuova tecnica che combina un portfolio di constraint solver con tecniche di machine learning. Il machine learning è un campo di intelligenza articiale che si pone l'obiettivo di immettere nelle macchine una sorta di `intelligenza'. Un esempio applicativo potrebbe essere quello di valutare i casi passati di un problema ed usarli in futuro per fare scelte. Tale processo è riscontrato anche a livello cognitivo umano. Nello specico, vogliamo ragionare in termini di classicazione. Una classicazione corrisponde ad assegnare ad un insieme di caratteristiche in input, un valore discreto in output, come vero o falso se una mail è classicata come spam o meno. La fase di apprendimento sarà svolta utilizzando una parte di CPHydra, un portfolio di constraint solver sviluppato presso la University College of Cork (UCC). Di tale algoritmo a portfolio verranno utilizzate solamente le caratteristiche usate per descrivere determinati aspetti di un CSP rispetto ad un altro; queste caratteristiche vengono altresì dette features. Creeremo quindi una serie di classicatori basati sullo specifico comportamento dei solver. La combinazione di tali classicatori con l'approccio a portfolio sara nalizzata allo scopo di valutare che le feature di CPHydra siano buone e che i classicatori basati su tali feature siano affidabili. Per giusticare il primo risultato, eettueremo un confronto con uno dei migliori portfolio allo stato dell'arte, SATzilla. Una volta stabilita la bontà delle features utilizzate per le classicazioni, andremo a risolvere i problemi simulando uno scheduler. Tali simulazioni testeranno diverse regole costruite con classicatori precedentemente introdotti. Prima agiremo su uno scenario ad un processore e successivamente ci espanderemo ad uno scenario multi processore. In questi esperimenti andremo a vericare che, le prestazioni ottenute tramite l'applicazione delle regole create appositamente sui classicatori, abbiano risultati migliori rispetto ad un'esecuzione limitata all'utilizzo del migliore solver del portfolio. I lavoro di tesi è stato svolto in collaborazione con il centro di ricerca 4C presso University College Cork. Su questo lavoro è stato elaborato e sottomesso un articolo scientico alla International Joint Conference of Articial Intelligence (IJCAI) 2011. Al momento della consegna della tesi non siamo ancora stati informati dell'accettazione di tale articolo. Comunque, le risposte dei revisori hanno indicato che tale metodo presentato risulta interessante.

A study on set variable representations in constraint programming

Il lavoro presentato in questa tesi si colloca nel contesto della programmazione con vincoli, un paradigma per modellare e risolvere problemi di ricerca combinatoria che richiedono di trovare soluzioni in presenza di vincoli. Una vasta parte di questi problemi trova naturale formulazione attraverso il linguaggio delle variabili insiemistiche. Dal momento che il dominio di tali variabili può essere esponenziale nel numero di elementi, una rappresentazione esplicita è spesso non praticabile. Recenti studi si sono quindi focalizzati nel trovare modi efficienti per rappresentare tali variabili. Pertanto si è soliti rappresentare questi domini mediante l'uso di approssimazioni definite tramite intervalli (d'ora in poi rappresentazioni), specificati da un limite inferiore e un limite superiore secondo un'appropriata relazione d'ordine. La recente evoluzione della ricerca sulla programmazione con vincoli sugli insiemi ha chiaramente indicato che la combinazione di diverse rappresentazioni permette di raggiungere prestazioni di ordini di grandezza superiori rispetto alle tradizionali tecniche di codifica. Numerose proposte sono state fatte volgendosi in questa direzione. Questi lavori si differenziano su come è mantenuta la coerenza tra le diverse rappresentazioni e su come i vincoli vengono propagati al fine di ridurre lo spazio di ricerca. Sfortunatamente non esiste alcun strumento formale per paragonare queste combinazioni. Il principale obiettivo di questo lavoro è quello di fornire tale strumento, nel quale definiamo precisamente la nozione di combinazione di rappresentazioni facendo emergere gli aspetti comuni che hanno caratterizzato i lavori precedenti. In particolare identifichiamo due tipi possibili di combinazioni, una forte ed una debole, definendo le nozioni di coerenza agli estremi sui vincoli e sincronizzazione tra rappresentazioni. Il nostro studio propone alcune interessanti intuizioni sulle combinazioni esistenti, evidenziandone i limiti e svelando alcune sorprese. Inoltre forniamo un'analisi di complessità della sincronizzazione tra minlex, una rappresentazione in grado di propagare in maniera ottimale vincoli lessicografici, e le principali rappresentazioni esistenti.

Hybrid constraint programming and metaheuristic methods for large scale optimization problems

This work presents hybrid Constraint Programming (CP) and metaheuristic methods for the solution of Large Scale Optimization Problems; it aims at integrating concepts and mechanisms from the metaheuristic methods to a CP-based tree search environment in order to exploit the advantages of both approaches. The modeling and solution of large scale combinatorial optimization problem is a topic which has arisen the interest of many researcherers in the Operations Research field; combinatorial optimization problems are widely spread in everyday life and the need of solving difficult problems is more and more urgent. Metaheuristic techniques have been developed in the last decades to effectively handle the approximate solution of combinatorial optimization problems; we will examine metaheuristics in detail, focusing on the common aspects of different techniques. Each metaheuristic approach possesses its own peculiarities in designing and guiding the solution process; our work aims at recognizing components which can be extracted from metaheuristic methods and re-used in different contexts. In particular we focus on the possibility of porting metaheuristic elements to constraint programming based environments, as constraint programming is able to deal with feasibility issues of optimization problems in a very effective manner. Moreover, CP offers a general paradigm which allows to easily model any type of problem and solve it with a problem-independent framework, differently from local search and metaheuristic methods which are highly problem specific. In this work we describe the implementation of the Local Branching framework, originally developed for Mixed Integer Programming, in a CP-based environment. Constraint programming specific features are used to ease the search process, still mantaining an absolute generality of the approach. We also propose a search strategy called Sliced Neighborhood Search, SNS, that iteratively explores slices of large neighborhoods of an incumbent solution by performing CP-based tree search and encloses concepts from metaheuristic techniques. SNS can be used as a stand alone search strategy, but it can alternatively be embedded in existing strategies as intensification and diversification mechanism. In particular we show its integration within the CP-based local branching. We provide an extensive experimental evaluation of the proposed approaches on instances of the Asymmetric Traveling Salesman Problem and of the Asymmetric Traveling Salesman Problem with Time Windows. The proposed approaches achieve good results on practical size problem, thus demonstrating the benefit of integrating metaheuristic concepts in CP-based frameworks.