Assessment of guanylin peptides system in type 2 diabetes

Os doentes com diabetes mellitus tipo 2 apresentam predisposição para a retenção de sódio e são frequentemente hipertensos. No entanto, os mecanismos implicados na dificuldade do rim diabético em mobilizar o sódio são, ainda, pouco compreendidos. Os peptídeos da família das guanilinas estão envolvidos na regulação do transporte de electrólitos e água nos epitélios intestinal e renal, através da activação do receptor guanilato ciclase-C (GC-C) e subsequente libertação intracelular de GMPc. O objectivo do presente estudo foi a avaliação da actividade do sistema dos peptídeos das guanilinas (SPG) e do seu papel na regulação do balanço de sódio num modelo animal de diabetes tipo 2. Ratinhos machos C57BL/6 foram submetidos a uma dieta com alto teor de gordura e rica em hidratos de carbono simples (ratinhos diabéticos) ou a uma dieta normal (ratinhos controlo). A expressão renal e intestinal da guanilina (GN), uroguanilina (UGN) e do receptor GC-C assim como os níveis de GMPc na urina e plasma foram avaliados nos ratinhos controlo e diabéticos, durante a ingestão de dietas normo (NS) e hiper-salina (HS). Nos ratinhos diabéticos, durante a dieta NS verificou-se um aumento significativo da pressão arterial que foi acompanhado de redução da expressão do ARNm da GN, UGN e do GC-C no intestino e de aumento da expressão de ARNm da UGN no rim. A dieta HS induziu um aumento da expressão do ARNm da UGN no jejuno dos ratinhos controlo mas não nos diabéticos. Os ratinhos diabéticos apresentaram níveis urinários de GMPc inferiores aos controlos, em condições de dieta NS. Em conclusão, os nossos resultados sugerem que na diabetes tipo 2 ocorre uma redução da actividade intestinal do SPG que é acompanhada por um aumento compensatório da actividade renal do SPG. A diminuição da actividade do SPG intestinal na diabetes tipo 2 deve-se não só a uma redução da expressão dos peptídeos GN e UGN, mas também a uma redução da expressão do seu receptor, GC-C. Estes resultados sugerem que o SPG pode contribuir para a sensibilidade ao sódio na diabetes.

Influencing factors on bread-derived exposure to ochratoxin A: type, origin and composition

The nearly ubiquitous consumption of cereals all over the world renders them an important position in international nutrition, but concurrently allocates exposure to possible contained contaminants. Mycotoxins are natural food contaminants, difficult to predict, evade, and reduce, so it is important to establish the real contribution of each contaminated food product, with the aim to evaluate mycotoxin exposure. This was the key objective of this survey and analysis for ochratoxin A content on 274 samples of commercialized bread in the Portuguese market, during the winter 2007. Different bread products were analyzed through an HPLC-FD method, including traditional types, novel segments, and different grain based bread products. A wide-ranging low level contamination was observed in all regions and types of bread products analyzed, especially in the Porto and Coimbra regions, and in the maize and whole-grain or fiber-enriched bread. Nevertheless, the exposure through contaminated wheat bread continues to be the most significant, given its high consumption and dominance in relation to the other types of bread.

Controllability results for impulsive mixed type functional integro-differential evolution equations with nonlocal conditions

In this paper, we establish the controllability for a class of abstract impulsive mixed-type functional integro-differential equations with finite delay in a Banach space. Some sufficient conditions for controllability are obtained by using the Mönch fixed point theorem via measures of noncompactness and semigroup theory. Particularly, we do not assume the compactness of the evolution system. An example is given to illustrate the effectiveness of our results.

A PTAS for assigning sporadic tasks on two-type heterogeneous multiprocessors

Consider the problem of determining a task-toprocessor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct kinds of processors. We propose a polynomialtime approximation scheme (PTAS) for this problem. It offers the following guarantee: for a given task set and a given platform, if there exists a feasible task-to-processor assignment, then given an input parameter, ϵ, our PTAS succeeds, in polynomial time, in finding such a feasible task-to-processor assignment on a platform in which each processor is 1+3ϵ times faster. In the simulations, our PTAS outperforms the state-of-the-art PTAS [1] and also for the vast majority of task sets, it requires significantly smaller processor speedup than (its upper bound of) 1+3ϵ for successfully determining a feasible task-to-processor assignment.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning real-time tasks on a heterogeneous multiprocessor platform comprising two different types of processors — such a platform is referred to as two-type platform. We present two linearithmic timecomplexity algorithms, SA and SA-P, each providing the follow- ing guarantee. For a given two-type platform and a given task set, if there exists a feasible task-to-processor-type assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type, then (i) using SA, it is guaranteed to find such a feasible task-to- processor-type assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding 2 a feasible task-to-processor assignment where tasks are not allowed to migrate between processors but given a platform in which processors are 1+α/times faster, where 0<α≤1. The parameter α is a property of the task set — it is the maximum utilization of any task which is less than or equal to 1.

Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of |R| shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr also meets deadlines if given processors 4+6*ceil(|R|/min(m1,m2)) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.

Two-type heterogeneous multiprocessor scheduling: Is there a phase transition? (Extended Abstract)

Consider the problem of non-migratively scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. We ask the following question: Does there exist a phase transition behavior for the two-type heterogeneous multiprocessor scheduling problem? We also provide some initial observations via simulations performed on randomly generated task sets.

Intra-type migrative scheduling of implicit-deadline sporadic tasks on two- type heterogeneous multiprocessor

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. Each processor is either of type-1 or type-2 with each task having different execution time on each processor type. Jobs can migrate between processors of same type (referred to as intra-type migration) but cannot migrate between processors of different types. We present a new scheduling algorithm namely, LP-Relax(THR) which offers a guarantee that if a task set can be scheduled to meet deadlines by an optimal task assignment scheme that allows intra-type migration then LP-Relax(THR) meets deadlines as well with intra-type migration if given processors 1/THR as fast (referred to as speed competitive ratio) where THR <= 2/3.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.

Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes

Consider scheduling of real-time tasks on a multiprocessor where migration is forbidden. Specifically, consider the problem of determining a task-to-processor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct types of processors. For this problem, we propose a new algorithm, LPC (task assignment based on solving a Linear Program with Cutting planes). The algorithm offers the following guarantee: for a given task set and a platform, if there exists a feasible task-to-processor assignment, then LPC succeeds in finding such a feasible task-to-processor assignment as well but on a platform in which each processor is 1.5 × faster and has three additional processors. For systems with a large number of processors, LPC has a better approximation ratio than state-of-the-art algorithms. To the best of our knowledge, this is the first work that develops a provably good real-time task assignment algorithm using cutting planes.

Cytotoxicity in L929 fibroblasts and inhibition of herpes simplex virus type 1 Kupka by estuarine cyanobacteria extracts

The cyanobacteria are known to be a rich source of metabolites with a variety of biological activities in different biological systems. In the present work, the bioactivity of aqueous and organic (methanolic and hexane) crude extracts of cyanobacteria isolated from estuarine ecosystems was studied using different bioassays. The assessment of DNA damage on the SOS gene repair region of mutant PQ37 strain of Escherichia coli was performed. Antiviral activity was evaluated against influenza virus, HRV-2, CVB3 and HSV-1 viruses using crystal violet dye uptake on HeLa, MDCK and GMK cell lines. Cytotoxicity evaluation was performed with L929 fibroblasts by MTT assay. Of a total of 18 cyanobacterial isolates studied, only the crude methanolic extract of LEGE 06078 proved to be genotoxic (IF > 1.5) in a dose-dependent manner and other four were putative candidates to induce DNA damage. Furthermore, the crude aqueous extract of LEGE 07085 showed anti- herpes type 1 activity (IC50 = 174.10 μg dry extract mL−1) while not presenting any cytotoxic activity against GMK cell lines. Of the 54 cyanobacterial extracts tested, only the crude methanolic and hexane ones showed impair on metabolic activity of L929 fibroblasts after long exposure (48–72 h). The inhibition of HSV-1 and the strong cytotoxicity against L929 cells observed emphasizes the importance of evaluating the impact of those estuarine cyanobacteria on aquatic ecosystem and on human health. The data also point out their potential application in HSV-1 treatment and pharmacological interest.