The COP9 signalosome counteracts the accumulation of cullin SCF ubiquitin E3 RING ligases during fungal development

Defects in the COP9 signalosome (CSN) impair multicellular development, including embryonic plant or animal death or a block in sexual development of the fungus Aspergillus nidulans. CSN deneddylates cullin-RING ligases (CRLs), which are activated by covalent linkage to ubiquitin-like NEDD8. Deneddylation allows CRL disassembly for subsequent reassembly. An attractive hypothesis is a consecutive order of CRLs for development, which demands repeated cycles of neddylation and deneddylation for reassembling CRLs. Interruption of these cycles could explain developmental blocks caused by csn mutations. This predicts an accumulation of neddylated CRLs exhibiting developmental functions when CSN is dysfunctional. We tested this hypothesis in A. nidulans, which tolerates reduced levels of neddylation for growth. We show that only genes for CRL subunits or neddylation are essential, whereas CSN is primarily required for development. We used functional tagged NEDD8, recruiting all three fungal cullins. Cullins are associated with the CSN1/CsnA subunit when deneddylation is defective. Two CRLs were identified which are specifically involved in differentiation and accumulate during the developmental block. This suggests that an active CSN complex is required to counteract the accumulation of specific CRLs during development.

Solar-Terrestrial Signal Record in Tree Ring Width Time Series from Brazil

This work investigates the behavior of the sunspot number and Southern Oscillation Index (SOI) signal recorded in the tree ring time series for three different locations in Brazil: Humaita in Amaznia State, Porto Ferreira in So Paulo State, and Passo Fundo in Rio Grande do Sul State, using wavelet and cross-wavelet analysis techniques. The wavelet spectra of tree ring time series showed signs of 11 and 22 years, possibly related to the solar activity, and periods of 2-8 years, possibly related to El Nio events. The cross-wavelet spectra for all tree ring time series from Brazil present a significant response to the 11-year solar cycle in the time interval between 1921 to after 1981. These tree ring time series still have a response to the second harmonic of the solar cycle (5.5 years), but in different time intervals. The cross-wavelet maps also showed that the relationship between the SOI x tree ring time series is more intense, for oscillation in the range of 4-8 years.

An integer linear programming approach for bilinear integer programming

We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear P. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems. (C) 2011 Elsevier B.V. All rights reserved.

Peripheral Sterile Corneal Ring Infiltrate After Riboflavin-UVA Collagen Cross-Linking in Keratoconus

Purpose: To present 7 cases of peripheral sterile corneal infiltrates that occurred after corneal cross-linking (CXL) for progressive keratectasia. Methods: Seven patients who had their progressive keratoconus documented underwent corneal deepithelization and subsequently CXL, which was performed with the application of 0.1% riboflavin with 20% dextran, and exposure to UVA light (370 nm, 2.9-3.1 mW/cm(2)) for 30 minutes. Results: Nearly a week after the procedure, the patients presented with peripheral stromal infiltrates. The ring-like infiltrates were superficial and were present at the 9.0-mm zone. Sterile infiltration was diagnosed. Patients were treated with topical corticosteroids, and complete resolution was achieved after a few weeks of treatment. Conclusions: We hypothesize that the phototoxic effect on the corneal stroma may be the main mechanism that triggers these infiltrates. Alternatively, alterations in antigenicity that occur in native proteins after CXL could result in patients recognizing the proteins as nonself and mounting immune responses.

Mechanisms of ring chromosome formation, ring instability and clinical consequences

Background The breakpoints and mechanisms of ring chromosome formation were studied and mapped in 14 patients. Methods Several techniques were performed such as genome-wide array, MLPA (Multiplex Ligation-Dependent Probe Amplification) and FISH (Fluorescent in situ Hybridization). Results The ring chromosomes of patients I to XIV were determined to be, respectively: r(3)(p26.1q29), r(4)(p16.3q35.2), r(10)(p15.3q26.2), r(10)(p15.3q26.13), r(13)(p13q31.1), r(13)(p13q34), r(14)(p13q32.33), r(15)(p13q26.2), r(18)(p11.32q22.2), r(18)(p11.32q21.33), r(18)(p11.21q23), r(22)(p13q13.33), r(22)(p13q13.2), and r(22)(p13q13.2). These rings were found to have been formed by different mechanisms, such as: breaks in both chromosome arms followed by end-to-end reunion (patients IV, VIII, IX, XI, XIII and XIV); a break in one chromosome arm followed by fusion with the subtelomeric region of the other (patients I and II); a break in one chromosome arm followed by fusion with the opposite telomeric region (patients III and X); fusion of two subtelomeric regions (patient VII); and telomere-telomere fusion (patient XII). Thus, the r(14) and one r(22) can be considered complete rings, since there was no loss of relevant genetic material. Two patients (V and VI) with r(13) showed duplication along with terminal deletion of 13q, one of them proved to be inverted, a mechanism known as inv-dup-del. Ring instability was detected by ring loss and secondary aberrations in all but three patients, who presented stable ring chromosomes (II, XIII and XIV). Conclusions We concluded that the clinical phenotype of patients with ring chromosomes may be related with different factors, including gene haploinsufficiency, gene duplications and ring instability. Epigenetic factors due to the circular architecture of ring chromosomes must also be considered, since even complete ring chromosomes can result in phenotypic alterations, as observed in our patients with complete r(14) and r(22).

A Galactic ring of minimum stellar density near the solar orbit radius

We analyse the secular effects of a long-lived Galactic spiral structure on the stellar orbits with mean radii close to the corotation resonance. By test-particle simulations and different spiral potential models with parameters constrained on observations, we verified the formation of a minimum with amplitude ∼30–40 per cent of the background disc stellar density at corotation. Such a minimum is formed by the secular angular momentum transfer between stars and the spiral density wave on both sides of corotation. We demonstrate that the secular loss (gain) of angular momentum and decrease (increase) of mean orbital radius of stars just inside (outside) corotation can counterbalance the opposite trend of exchange of angular momentum shown by stars orbiting the librational points L4/5 at the corotation circle. Such secular processes actually allow steady spiral waves to promote radial migration across corotation. We propose some pieces of observational evidence for the minimum stellar density in the Galactic disc, such as its direct relation to the minimum in the observed rotation curve of the Galaxy at the radius r ∼ 9 kpc (for R0 = 7.5 kpc), as well as its association with a minimum in the distribution of Galactic radii of a sample of open clusters older than 1Gyr. The closeness of the solar orbit adius to the corotation resonance implies that the solar orbit lies inside a ring of minimum surface density (stellar + gas). This also implies a correction to larger values for the estimated total mass of the Galactic disc, and consequently, a greater contribution of the disc componente to the inner rotation curve of the Galaxy.

Nonlocal asymmetric exclusion process on a ring and conformal invariance

We present a one-dimensional nonlocal hopping model with exclusion on a ring. The model is related to the Raise and Peel growth model. A nonnegative parameter u controls the ratio of the local backwards and nonlocal forwards hopping rates. The phase diagram, and consequently the values of the current, depend on u and the density of particles. In the special case of half-lling and u = 1 the system is conformal invariant and an exact value of the current for any size L of the system is conjectured and checked for large lattice sizes in Monte Carlo simulations. For u > 1 the current has a non-analytic dependence on the density when the latter approaches the half-lling value.

Preliminary interpretation of growth ring on the otolith of Boops boops off Gran Canaria (Canary Islands)

Máster en Gestión Sostenible de Recursos Pesqueros

Nuovi catalizzatori per l'idrogenazione, l'idrogenolisi/ring-opening di composti aromatici policiclici

The removal of aromatic hydrocarbons from diesel has received considerable attention after environmental regulations that require petroleum refiners to raise cetane number and to limit aromatics in diesel fuel in order to improve combustion efficiency and reduce particulate and NOx emissions. An alternative is blending with Fischer–Tropsch (FT) gas-to-liquid diesel fuel; however, this option may not be economically viable solution in case of extensive blend. Another alternative is to incorporate in the diesel pool a greater fraction of the so-called light cycle oil (LCO). Due to its high aromatics content and its low cetane number (typically between 20 and 30), the incorporation of LCO may have a negative impact on the quality of diesel. Current technologies for LCO improvement are based on hydrogenation to adjust both sulphur and cetane number but while an important fraction of the aromatics present in LCO can be saturated in a deep hydrogenation process, the cetane number may still be lower than the target values specified in diesel legislations, so further upgrading is needed. An interesting technology for improving the cetane number of diesels and maintaining meanwhile high diesel yields is achieved by combining a complete hydrogenation process with a selective ring opening (SRO) reaction of the naphthenic rings. The SRO can be defined as naphthene ring-opening to form compounds with high cetane number, but without any carbon losses. Controlling the interconversion of six- and five- membered rings via an acid-catalyzed ring-contraction step is also of great importance, since selective conversion of six-membered to five-membered naphthene rings greatly influences ring-opening rates and selectivity. High intrinsic activity may be enhanced by deposition of noble metals on acidic, high surface area supports, because it is possible to arrange close proximity of the metal and acid sites. Moreover, in large-pore supports, the diffusion resistance of liquid reactants into the pores is minimized. In addition to metal centres, the acid sites of support also plays role in aromatics hydrogenation. However, the functions of different kinds of acid sites (Brønsted vs. Lewis acidity), and their optimal concentrations and strengths, remain unclear. In the present study we investigated the upgrading of an aromatic-rich feedstock over different type of metal supported on mesoporous silica-alumina. The selective hydrogenolysis and ring opening of tetrahydronaphthalene (THN or tetralin) was carried out as representative of LCO fractions after deep hydrogenation process. In this regards the aim of this study is to evaluate both the effect of metals and that of the supports characterized by different acid distribution and strength, on conversion and selectivity. For this purpose a series of catalysts were prepared by impregnation. The catalysts were characterized and conversion tests of THN were performed in a lab-scale plant operating in the pressure range from 7.0-5.0 MPa and in the temperature range from 300 to 360°C.

Application-oriented Mixed Integer Non-Linear Programming

In the most recent years there is a renovate interest for Mixed Integer Non-Linear Programming (MINLP) problems. This can be explained for different reasons: (i) the performance of solvers handling non-linear constraints was largely improved; (ii) the awareness that most of the applications from the real-world can be modeled as an MINLP problem; (iii) the challenging nature of this very general class of problems. It is well-known that MINLP problems are NP-hard because they are the generalization of MILP problems, which are NP-hard themselves. However, MINLPs are, in general, also hard to solve in practice. We address to non-convex MINLPs, i.e. having non-convex continuous relaxations: the presence of non-convexities in the model makes these problems usually even harder to solve. The aim of this Ph.D. thesis is to give a flavor of different possible approaches that one can study to attack MINLP problems with non-convexities, with a special attention to real-world problems. In Part 1 of the thesis we introduce the problem and present three special cases of general MINLPs and the most common methods used to solve them. These techniques play a fundamental role in the resolution of general MINLP problems. Then we describe algorithms addressing general MINLPs. Parts 2 and 3 contain the main contributions of the Ph.D. thesis. In particular, in Part 2 four different methods aimed at solving different classes of MINLP problems are presented. Part 3 of the thesis is devoted to real-world applications: two different problems and approaches to MINLPs are presented, namely Scheduling and Unit Commitment for Hydro-Plants and Water Network Design problems. The results show that each of these different methods has advantages and disadvantages. Thus, typically the method to be adopted to solve a real-world problem should be tailored on the characteristics, structure and size of the problem. Part 4 of the thesis consists of a brief review on tools commonly used for general MINLP problems, constituted an integral part of the development of this Ph.D. thesis (especially the use and development of open-source software). We present the main characteristics of solvers for each special case of MINLP.

Enhanced Mixed Integer Programming Techniques and Routing Problems

Mixed integer programming is up today one of the most widely used techniques for dealing with hard optimization problems. On the one side, many practical optimization problems arising from real-world applications (such as, e.g., scheduling, project planning, transportation, telecommunications, economics and finance, timetabling, etc) can be easily and effectively formulated as Mixed Integer linear Programs (MIPs). On the other hand, 50 and more years of intensive research has dramatically improved on the capability of the current generation of MIP solvers to tackle hard problems in practice. However, many questions are still open and not fully understood, and the mixed integer programming community is still more than active in trying to answer some of these questions. As a consequence, a huge number of papers are continuously developed and new intriguing questions arise every year. When dealing with MIPs, we have to distinguish between two different scenarios. The first one happens when we are asked to handle a general MIP and we cannot assume any special structure for the given problem. In this case, a Linear Programming (LP) relaxation and some integrality requirements are all we have for tackling the problem, and we are ``forced" to use some general purpose techniques. The second one happens when mixed integer programming is used to address a somehow structured problem. In this context, polyhedral analysis and other theoretical and practical considerations are typically exploited to devise some special purpose techniques. This thesis tries to give some insights in both the above mentioned situations. The first part of the work is focused on general purpose cutting planes, which are probably the key ingredient behind the success of the current generation of MIP solvers. Chapter 1 presents a quick overview of the main ingredients of a branch-and-cut algorithm, while Chapter 2 recalls some results from the literature in the context of disjunctive cuts and their connections with Gomory mixed integer cuts. Chapter 3 presents a theoretical and computational investigation of disjunctive cuts. In particular, we analyze the connections between different normalization conditions (i.e., conditions to truncate the cone associated with disjunctive cutting planes) and other crucial aspects as cut rank, cut density and cut strength. We give a theoretical characterization of weak rays of the disjunctive cone that lead to dominated cuts, and propose a practical method to possibly strengthen those cuts arising from such weak extremal solution. Further, we point out how redundant constraints can affect the quality of the generated disjunctive cuts, and discuss possible ways to cope with them. Finally, Chapter 4 presents some preliminary ideas in the context of multiple-row cuts. Very recently, a series of papers have brought the attention to the possibility of generating cuts using more than one row of the simplex tableau at a time. Several interesting theoretical results have been presented in this direction, often revisiting and recalling other important results discovered more than 40 years ago. However, is not clear at all how these results can be exploited in practice. As stated, the chapter is a still work-in-progress and simply presents a possible way for generating two-row cuts from the simplex tableau arising from lattice-free triangles and some preliminary computational results. The second part of the thesis is instead focused on the heuristic and exact exploitation of integer programming techniques for hard combinatorial optimization problems in the context of routing applications. Chapters 5 and 6 present an integer linear programming local search algorithm for Vehicle Routing Problems (VRPs). The overall procedure follows a general destroy-and-repair paradigm (i.e., the current solution is first randomly destroyed and then repaired in the attempt of finding a new improved solution) where a class of exponential neighborhoods are iteratively explored by heuristically solving an integer programming formulation through a general purpose MIP solver. Chapters 7 and 8 deal with exact branch-and-cut methods. Chapter 7 presents an extended formulation for the Traveling Salesman Problem with Time Windows (TSPTW), a generalization of the well known TSP where each node must be visited within a given time window. The polyhedral approaches proposed for this problem in the literature typically follow the one which has been proven to be extremely effective in the classical TSP context. Here we present an overall (quite) general idea which is based on a relaxed discretization of time windows. Such an idea leads to a stronger formulation and to stronger valid inequalities which are then separated within the classical branch-and-cut framework. Finally, Chapter 8 addresses the branch-and-cut in the context of Generalized Minimum Spanning Tree Problems (GMSTPs) (i.e., a class of NP-hard generalizations of the classical minimum spanning tree problem). In this chapter, we show how some basic ideas (and, in particular, the usage of general purpose cutting planes) can be useful to improve on branch-and-cut methods proposed in the literature.

Coil-ring-coil block copolymers as building blocks of supramolecular hollow cylindrical brushes

This work describes the synthesis of a new class of rod-coil block copolymers, oligosubstituted shape persistent macrocycles, (coil-ring-coil block copolymers), and their behavior in solution and in the solid state.The coil-ring-coil block copolymers are formed by nanometer sized shape persistent macrocycles based on the phenyl-ethynyl backbone as rigid block and oligomers of polystyrene or polydimethylsiloxane as flexible blocks. The strategy that has been followed is to synthesize the macrocycles with an alcoholic functionality and the polymer carboxylic acids independently, and then bind them together by esterification. The ester bond is stable and relatively easy to form.The synthesis of the shape persistent macrocycles is based on two separate steps. In the first step the building blocks of the macrocycles are connected by Hagiara-Sogonaschira coupling to form an 'half-ring' as precursor, that contains two free acetylenes. In the second step the half-ring is cyclized by forming two sp-sp bonds via a copper-catalyzed Glaser coupling under pseudo-high-dilution conditions. The polystyrene carboxylic acid was prepared directly by siphoning the living anionic polymer chain into a THF solution, saturated with CO2, while the polydimethylsiloxane carboxylic acid was obtained by hydrosilylating an unsaturated benzylester with an Si-H terminated polydimethylsiloxane, and cleavage of the ester. The carbodiimide coupling was found to be the best way to connect macrocycles and polymers in high yield and high purity.The polystyrene-ring-polystyrene block copolymers are, depending on the molecular weight of the polystyrene, lyotropic liquid crystals in cyclohexane. The aggregation behavior of the copolymers in solution was investigated in more detail using several technique. As a result it can be concluded that the polystyrene-ring-polystyrene block copolymers can aggregate into hollow cylinder-like objects with an average length of 700 nm by a combination of shape complementary and demixing of rigid and flexible polymer parts. The resulting structure can be described as supramolecular hollow cylindrical brush.If the lyotropic solution of the polystyrene-ring-polystyrene block copolymers are dried, they remain birefringent indicating that the solid state has an ordered structure. The polydimethylsiloxane-ring-polydimethylsiloxane block copolymers are more or less fluid at room temperature, and are all birefringent (termotropic liquid crystals) as well. This is a prove that the copolymers are ordered in the fluid state. By a careful investigation using electron diffraction and wide-angle X-ray scattering, it has been possible to derive a model for the 3D-order of the copolymers. The data indicate a lamella structure for both type of copolymers. The macrocycles are arranged in a layer of columns. These crystalline layers are separated by amorphous layers which contain the polymers substituents.

Decomposition and reformulation of integer linear programming problems

This thesis deals with an investigation of Decomposition and Reformulation to solve Integer Linear Programming Problems. This method is often a very successful approach computationally, producing high-quality solutions for well-structured combinatorial optimization problems like vehicle routing, cutting stock, p-median and generalized assignment . However, until now the method has always been tailored to the specific problem under investigation. The principal innovation of this thesis is to develop a new framework able to apply this concept to a generic MIP problem. The new approach is thus capable of auto-decomposition and autoreformulation of the input problem applicable as a resolving black box algorithm and works as a complement and alternative to the normal resolving techniques. The idea of Decomposing and Reformulating (usually called in literature Dantzig and Wolfe Decomposition DWD) is, given a MIP, to convexify one (or more) subset(s) of constraints (slaves) and working on the partially convexified polyhedron(s) obtained. For a given MIP several decompositions can be defined depending from what sets of constraints we want to convexify. In this thesis we mainly reformulate MIPs using two sets of variables: the original variables and the extended variables (representing the exponential extreme points). The master constraints consist of the original constraints not included in any slaves plus the convexity constraint(s) and the linking constraints(ensuring that each original variable can be viewed as linear combination of extreme points of the slaves). The solution procedure consists of iteratively solving the reformulated MIP (master) and checking (pricing) if a variable of reduced costs exists, and in which case adding it to the master and solving it again (columns generation), or otherwise stopping the procedure. The advantage of using DWD is that the reformulated relaxation gives bounds stronger than the original LP relaxation, in addition it can be incorporated in a Branch and bound scheme (Branch and Price) in order to solve the problem to optimality. If the computational time for the pricing problem is reasonable this leads in practice to a stronger speed up in the solution time, specially when the convex hull of the slaves is easy to compute, usually because of its special structure.

New integer programming models for balanced multi-country kep

Le persone che soffrono di insufficienza renale terminale hanno due possibili trattamenti da affrontare: la dialisi oppure il trapianto di organo. Nel caso volessero seguire la seconda strada, oltre che essere inseriti nella lista d'attesa dei donatori deceduti, possono trovare una persona, come il coniuge, un parente o un amico, disposta a donare il proprio rene. Tuttavia, non sempre il trapianto è fattibile: donatore e ricevente possono, infatti, presentare delle incompatibilità a livello di gruppo sanguigno o di tessuto organico. Come risposta a questo tipo di problema nasce il KEP (Kidney Exchange Program), un programma, ampiamente avviato in diverse realtà europee e mondiali, che si occupa di raggruppare in un unico insieme le coppie donatore/ricevente in questa stessa situazione al fine di operare e massimizzare scambi incrociati di reni fra coppie compatibili. Questa tesi approffondisce tale questione andando a valutare la possibilità di unire in un unico insieme internazionale coppie donatore/ricevente provenienti da più paesi. Lo scopo, naturalmente, è quello di poter ottenere un numero sempre maggiore di trapianti effettuati. Lo studio affronta dal punto di vista matematico problematiche legate a tale collaborazione: i paesi che eventualmente accettassero di partecipare a un simile programma, infatti, devono avere la garanzia non solo di ricavarne un vantaggio, ma anche che tale vantaggio sia equamente distribuito fra tutti i paesi partecipanti.

Influence of micro-site conditions and environmental gradients on tree-ring based climate reconstructions

Tree-ring chronologies are a powerful natural archive to reconstruct summer temperature variations of the late Holocene with an annual resolution. To develop these long-term proxy records tree-ring series are commonly extended back in time by combining samples from living trees with relict dead material preserved onshore or in lakes. Former studies showed that low frequency variations in such reconstructions can be biased if the relict and recent material is from different origins. A detailed analysis of the influence of various ecological (micro-) habitats representing the recent part is required to estimate potential errors in temperature estimates. The application of collective detrending methods, that comprise absolute growth rates, can produce errors in climate reconstructions and results in an underestimation of past temperatures. The appearance of these kind of micro-site effects is a wide-spread phenomenon that takes place all over Fennoscandia. Future research in this key region for dendroclimatology should take this issue into account. Especially the higher climate response at the lakeshore site is interesting to achieve smaller uncertainties when a tree-ring series is transformed to temperature anomalies. For new composite chronologies the main aim should be to minimize potential biases and this includes also micro-site effects.