The binding of synthetic triiodo L-thyronine analogs to human transthyretin: Molecular basis of cooperative and non-cooperative ligand recognition

Transthyretin (TTR) is a tetrameric beta-sheet-rich transporter protein directly involved in human amyloid diseases. Several classes of small molecules can bind to TTR delaying its amyloid fibril formation, thus being promising drug candidates to treat TTR amyloidoses. In the present study, we characterized the interactions of the synthetic triiodo L-thyronine analogs and thyroid hormone nuclear receptor TR beta-selecfive agonists GC-1 and GC-24 with the wild type and V30M variant of human transthyretin (TTR). To achieve this aim, we conducted in vitro TTR acid-mediated aggregation and isothermal titration calorimetry experiments and determined the TTR:GC-1 and TTR:GC-24 crystal structures. Our data indicate that both GC-1 and GC-24 bind to TTR in a non-cooperative manner and are good inhibitors of TTR aggregation, with dissociation constants for both hormone binding sites (HBS) in the low micromolar range. Analysis of the crystal structures of TTRwt:GC-1(24) complexes and their comparison with the TTRwt X-ray structure bound to its natural ligand thyroxine (T4) suggests, at the molecular level, the basis for the cooperative process displayed by T4 and the non-cooperative process provoked by both GC-1 and GC-24 during binding to TTR. (C) 2010 Elsevier Inc. All rights reserved.

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks` dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.

Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.

February 2002: Futures, Part III, Cooperative Ventures and Services

http://digitalcommons.winthrop.edu/dacusfocus/1017/thumbnail.jpg

November 2001: P.A.S.C.A.L: The Cooperative Spirit

http://digitalcommons.winthrop.edu/deanscorner/1014/thumbnail.jpg

The open capacitated arc routing problem

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Reactive Control for Transmission Overload Relief Based on Sensitivity Analysis and Cooperative Game Theory

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Blue cooperative luminescence in Yb3+-doped tellurite glasses excited at 1.064 mu m

Blue luminescence emission around 480 nm through cooperative upconversion from pairs of Yb3+ ions implanted into 60TeO(2)-10GeO(2)-10K(2)O-10Li(2)O-10Nb(2)O(5) tellurite glasses and excited by a cw laser at 1.064 mum is demonstrated. Cooperative luminescence emission enhancement owing to the temperature dependent multiphonon-assisted anti-Stokes excitation process of the ytterbium ions is also observed. The experimental results revealed a fourfold enhancement in the cooperative luminescence emission when the sample was heated in the temperature range of 20 degreesC-260 degreesC. The thermally induced enhancement is assigned to the effective absorption cross-section for the ytterbium ions which is an increasing function of the medium temperature. (C) 2002 American Institute of Physics.

The Brazilian pediatric myelodysplastic cooperative group strategies: are they relevant to improve educational approach and correct diagnosis?

Brazil is a wide country with huge contrasts. Its peculiarities can highlight environmental factors that could influence the frequencies of different cancers. The standard treatment and results achieved from several different areas of the country may not be found in others. The establishment of a national cooperative group has the potential to improve outcomes. The The Brazilian Cooperative Group on Pediatric Patients with Myelodysplastic Syndrome (BCG-MDS-PED) was first organized in January 1997 as a working group of hematologists, pediatric oncologists, pediatric-hematologists, molecular biologists and other professionals in order to study pediatric (age < 18 years) MDS. Six distinct subcommittees constituted with members from several universities: cytology, histopathology, clinical, cytogenetics, molecular biology and epidemiology. The goals of the BCG-MDS-PED were: (i) to offer support for diagnosis and orientation for treatment; (ii) educational Support for the colleagues all over the country and (iii) research on pathogenesis and new approaches for pediatric MDS patients. There are socio-economical differences among the five regions of the country. The BCG-MDS-PED believes that it is absolutely necessary to Study the clinical, cellular, molecular and epidemiological aspects of MDS, taking in account these peculiar differences among populations and regions. Since 1997, 114 pediatric cases were referred to the BCG-MDS-PED from 21 centres. Seven Brazilian states have sent cases to the group, 31 patients were referred from universities, 73 patients from pediatric oncology units (foundations) and 10 patients came from private clinics. Some of these patients have been followed up and/or treated by the physician who referred them to the BCG-MDS-PED for confirmation of the initial diagnosis. The majority of these physicians have required orientation on diagnostic and treatment issues, as well as to complete cytogenetic and molecular studies. From these 114 patients, 64 patients were confirmed as MDS. We believe that, the more numerous the MDS-studied cases, the more experienced will be the referee group on clinical and laboratory features on childhood MDS in Brazil. (C) 2002 Published by Elsevier B.V. Ltd.

Thermally enhanced cooperative energy-transfer frequency upconversion in terbium and ytterbium doped tellurite glass

Infrared-to-visible frequency upconversion through cooperative energy-transfer and thermal effects in Tb3+/Yb3+-codoped tellurite glasses excited at 1.064 mum is investigated. Bright luminescence emission around 485, 550, 590, 625 and 65 nm, identified as due to the D-5(4) --> F-7(J) (J= 6, 5, 4, 3, and 2) transitions of the terbium ions, respectively, was recorded. The excitation of the D-5(4) emitting level of the Tb3+ ions is assigned to cooperative energy-transfer from pairs of ytterbium ions.. The effect of temperature on the upconversion process was examined and the results revealed a fourfold upconversion enhancement in the 300-500 K interval. The enhancement of the upconversion process is due to the temperature dependence of the Yb3+-sensitizer absorption cross-section under anti-Stokes excitation. A rate-equation. model using multiphonon-assisted absorption for the ytterbium excitation combined with the energy migration effect between Yb-Yb pair, and Tb3+ ground-state depopulation via multiphonon excitation of the F-7(J) excited states describes quite well the experimental results. (C) 2003 Elsevier B.V. B.V. All rights reserved.