Population pharmacokinetics of tacrolimus in children who receive cut-down or full liver transplants

Background. The aim of this study was to investigate the population pharmacokinetics of tacrolimus in pediatric liver transplant recipients and to identify factors that may explain pharmacokinetic variability. Methods. Data were collected retrospectively from 35 children who received oral immunosuppressant therapy with tacrolimus. Maximum likelihood estimates were sought for the typical values of apparent clearance (CL/F) and apparent volume of distribution (V/F) with the program NONMEM. Factors screened for influence on the pharmacokinetic parameters were weight, age, gender, postoperative day, days since commencing tacrolimus therapy, transplant type (whole child liver or cut-down adult liver), liver function tests (bilirubin, alkaline phosphatase [ALP], aspartate aminotransferase [AST], gamma -glutamyl transferase [GGT], alanine aminotransferase [ALT]), creatinine clearance, hematocrit, corticosteroid dose, and concurrent therapy with metabolic inducers and inhibitors of tacrolimus. Results. No clear correlation existed between tacrolimus dosage and blood concentrations (r(2) =0.003). Transplant type, age, and liver function test values were the most important factors (P

R-matrices and the tensor product graph method

A systematic method for constructing trigonometric R-matrices corresponding to the (multiplicity-free) tensor product of any two affinizable representations of a quantum algebra or superalgebra has been developed by the Brisbane group and its collaborators. This method has been referred to as the Tensor Product Graph Method. Here we describe applications of this method to untwisted and twisted quantum affine superalgebras.

Factorizations of the complete graph into C-5-factors and 1-factors

In this paper, we show that K-10n can be factored into alpha C-5-factors and beta 1-factors for all non-negative integers alpha and beta satisfying 2alpha + beta = 10(n) - 1.

Execução de túneis com recurso ao método cut anda cover

Neste trabalho apresenta-se uma abordagem sobre a conceção e execução de túneis que incide na metodologia de execução de galerias a céu aberto (mais conhecida pela designação utilizada na língua inglesa – cut and cover). Na primeira parte do trabalho é enquadrado o tema, introduzindo-se uma perspetiva sobre a sua evolução histórica, descrevem-se as principais metodologias adotadas na construção de túneis, afloram-se as vantagens e desvantagens de cada metodologia, abordam-se de forma sumária assuntos como a instrumentação utilizada no controlo da segurança na construção destas obras e empreendimentos envolventes assim como os benefícios obtidos com a construção deste tipo de obra. Numa segunda fase do trabalho abordam-se as principais práticas, critérios e normativas utilizadas no desenvolvimento de modelos estruturais que suportam as verificações de segurança na fase de projeto. Finalmente recorre-se a um estudo de caso para mostrar e discutir a aplicação prática de alguns dos critérios e normas antes referidos, bem como para verificar e discutir o estado de tensão de algumas das secções de referência da obra em análise, assim como correlacionar esse estado de tensão e de deformação com as diferentes soluções estruturais adotadas para a sua construção, nomeadamente a execução de cortinas de estacas ou taludes e banquetas na escavação.

Augmented LDPC Graph for Distributed Video Coding with Multiple Side Information

The advances made in channel-capacity codes, such as turbo codes and low-density parity-check (LDPC) codes, have played a major role in the emerging distributed source coding paradigm. LDPC codes can be easily adapted to new source coding strategies due to their natural representation as bipartite graphs and the use of quasi-optimal decoding algorithms, such as belief propagation. This paper tackles a relevant scenario in distributedvideo coding: lossy source coding when multiple side information (SI) hypotheses are available at the decoder, each one correlated with the source according to different correlation noise channels. Thus, it is proposed to exploit multiple SI hypotheses through an efficient joint decoding technique withmultiple LDPC syndrome decoders that exchange information to obtain coding efficiency improvements. At the decoder side, the multiple SI hypotheses are created with motion compensated frame interpolation and fused together in a novel iterative LDPC based Slepian-Wolf decoding algorithm. With the creation of multiple SI hypotheses and the proposed decoding algorithm, bitrate savings up to 8.0% are obtained for similar decoded quality.

Cut-off point for WHOQOL-bref as a measure of quality of life of older adults

OBJECTIVE To propose a cut-off for the World Health Organization Quality of Life-Bref (WHOQOL-bref) as a predictor of quality of life in older adults. METHODS Cross-sectional study with 391 older adults registered in the Northwest Health District in Belo Horizonte, MG, Southeastern Brazil, between October 8, 2010 and May 23, 2011. The older adults’ quality of life was measured using the WHOQOL-bref. The analysis was rationalized by outlining two extreme and simultaneous groups according to perceived quality of life and satisfaction with health (quality of life good/satisfactory – good or very good self-reported quality of life and being satisfied or very satisfied with health – G5; and poor/very poor quality of life – poor or very poor self-reported quality of life and feeling dissatisfied or very dissatisfied with health – G6). A Receiver-Operating Characteristic curve (ROC) was created to assess the diagnostic ability of different cut-off points of the WHOQOL-bref. RESULTS ROC curve analysis indicated a critical value 60 as the optimal cut-off point for assessing perceived quality of life and satisfaction with health. The area under the curve was 0.758, with a sensitivity of 76.8% and specificity of 63.8% for a cut-off of ≥ 60 for overall quality of life (G5) and sensitivity 95.0% and specificity of 54.4% for a cut-off of < 60 for overall quality of life (G6). CONCLUSIONS Diagnostic interpretation of the ROC curve revealed that cut-off < 60 for overall quality of life obtained excellent sensitivity and negative predictive value for tracking older adults with probable worse quality of life and dissatisfied with health.

Fresh-cut aromatic herbs: Nutritional quality stability during shelf-life

Fresh-cut vegetables are a successful convenient healthy food. Nowadays, the presence of new varieties of minimally processed vegetables in the market is common in response to the consumers demand for new flavours and high quality products. Within the most recent fresh-cut products are the aromatic herbs. In this work, the objective was to evaluate the nutritional quality and stability of four fresh-cut aromatic herbs. Several physicochemical quality characteristics (colour, pH, total soluble solids, and total titratable acidity) were monitored in fresh-cut chives, coriander, spearmint and parsley leaves, stored under refrigeration (3 ± 1 ºC) during 10 days. Their nutritional composition was determined, including mineral composition (phosphorous, potassium, sodium, calcium, magnesium, iron, zinc, manganese and copper) and fat- and water-soluble vitamin contents. Total soluble phenolics, flavonoids and the antioxidant capacity were determined by spectrophotometric methods. The aromatic herbs kept their fresh appearance during the storage, maintaining their colour throughout shelf-life. Their macronutrient composition and mineral content were stable during storage. Coriander had the highest mineral and fatsoluble vitamin content, while spearmint showed the best scores in the phenolic, flavonoid and antioxidant capacity assays. Vitamins and antioxidant capacity showed some variation during storage, with a differential behaviour of each compound according to the sample.

An integer programming framework for sequencing cutting patterns based on interval graph completion

We derived a framework in integer programming, based on the properties of a linear ordering of the vertices in interval graphs, that acts as an edge completion model for obtaining interval graphs. This model can be applied to problems of sequencing cutting patterns, namely the minimization of open stacks problem (MOSP). By making small modifications in the objective function and using only some of the inequalities, the MOSP model is applied to another pattern sequencing problem that aims to minimize, not only the number of stacks, but also the order spread (the minimization of the stack occupation problem), and the model is tested.

An integer programming model for the minimum interval graph completion problem

The minimum interval graph completion problem consists of, given a graph G = ( V, E ), finding a supergraph H = ( V, E ∪ F ) that is an interval graph, while adding the least number of edges |F| . We present an integer programming formulation for solving the minimum interval graph completion problem recurring to a characteri- zation of interval graphs that produces a linear ordering of the maximal cliques of the solution graph.

Sequencing cutting patterns with colored interval graphs

The problem addressed here originates in the industry of flat glass cutting and wood panel sawing, where smaller items are cut from larger items accordingly to predefined cutting patterns. In this type of industry the smaller pieces that are cut from the patterns are piled around the machine in stacks according to the size of the pieces, which are moved to the warehouse only when all items of the same size have been cut. If the cutting machine can process only one pattern at a time, and the workspace is limited, it is desirable to set the sequence in which the cutting patterns are processed in a way to minimize the maximum number of open stacks around the machine. This problem is known in literature as the minimization of open stacks (MOSP). To find the best sequence of the cutting patterns, we propose an integer programming model, based on interval graphs, that searches for an appropriate edge completion of the given graph of the problem, while defining a suitable coloring of its vertices.