Alterações clínicas e laboratoriais de equinos submetidos à biópsia hepática com agulha Tru-cut guiada por ultrassom

Pós-graduação em Medicina Veterinária - FCAV

A survey on the set of periods of the graph homeomorphisms

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

Pulsing With Low Concentration Gibberellin Plus Benzyladenine or Commercial Floral Preservatives Affect Postharvest Longevity, Quality, and Leaf Chlorosis of Cut Lilies and Gladioli

Effects of pulsing with different concentrations of gibberellin plus benzyladenine (GA(4+7) + BA), a proprietary mixture of GA(4+7) plus BA in a commercial floral preservative (GA(4+7) + BA + preservative), or a propriety mixture of sugar plus acidifier developed for bulbous flowers (floral bulb preservative) were studied on postharvest performance and quality of cut lily (Lilium hybrids) and gladiolus ( Gladiolus hybrids) flowers. Pulsing of cut stems of lily with GA(4+7) + BA at 5 or 2 mL.L-1 GA(4+7) + BA + preservative for 20 hours at 3 +/- 1 degrees C extended the vase life and controlled leaf chlorosis of 'Cobra'oriental lily and 'Cappuccino'and Pot Corn'asiatic lily. Cut 'Orange Art'asiatic lily performed best when pulsed with GA(4+7) + BA at 10 mg.L-1. For cut gladiolus, pulsing with GA(4+7) + BA at 10 mg.L-1 extended the vase life of 'Alice', 'Mammoth', and 'Passion', while 'Scarlet'had the longest vase life when pulsed with 5 mg.L-1 GA(4+7) + BA. GA(4+7) + BA + preservative also extended the vase life and controlled leaf chlorosis, but the floral bulb preservative had no effect on vase life extension or preventing leaf chlorosis of lilies. Gladiolus cultivars had no or minor leaf chlorosis during vase period. Overall, overnight pulsing with GA(4+7) + BA + or GA(4+7) + BA + preservative extended the vase life and prevented leaf chlorosis

Effect of natural antimicrobials on microbiological and sensorial quality of fresh-cut cantaloupe melon

The effect of different natural antimicrobials on the microbiological and sensorial quality of fresh-cut Cantaloupe melons stored up to 10 days at 5°C was examined. Pieces of melon were washed for 1 min at 5ºC in water (control), vanillin (1000 mg/L and 2000 mg/L) or cinnamic acid (148.16 mg/L and 296.32 mg/L). Other antimicrobial treatments consisted of packaging the pieces of melon with an antimicrobial pad which contained cinnamic acid (148.16 mg/L and 296.32 mg/L). After 10 days of storage, significant differences among antimicrobials treatments and water treatment were found. In water treatment, the psychrotroph load was 3.63 ± 0.09 log cfu g-1 meanwhile on all antimicrobial treatments the values ranged from 3.04 ±0.13 log cfu g-1 to 3.28±0.1 log cfu g-1. Mesophilic growth in the control treatment averaged 6.79±0.06 log cfu g-1 meanwhile on antimicrobial treatments the counts were from 5.15±0.01 log cfu g-1 to 5.30±0.03 log cfu g-1. Total coliform levels were 7.8±0.1 log cfu g-1 when melon was washed in water, followed by washing with cinnamon (296.32 mg/L) at 6.5 log cfu g-1 and for the rest of the treatments were around 5.5 log cfu g-1. The treatments did not display differences among mould and yeast growth after 10 days of storage. The sensorial quality decreased throughout storage. However, at the end of storage, the scores ranged between 6.5 and 7, above the minimum level for marketability (level 5). Sensorial panelist noted a ‘sweet’ taste when vanillin was used as sanitizer. In all antimicrobial treatments, no relation was found between a higher dose and a higher microbial reduction. So, vanillin at 1000 mg/L in water or cinnamic acid at 148.16 mg/L provided in water dip or as a pad inside the trays could be optimal natural sanitizers to substitute the use of chlorine in fresh-cut products as Cantaloupe melon.

A Graph Model for DynamicWaveband Switching in WDM Mesh Networks

We investigate the problem of waveband switching (WBS) in a wavelength-division multiplexing (WDM) mesh network with dynamic traffic requests. To solve the WBS problem in a homogeneous dynamic WBS network, where every node is a multi-granular optical cross-connect (MG-OXC), we construct an auxiliary graph. Based on the auxiliary graph, we develop two heuristic on-line WBS algorithms with different grouping policies, namely the wavelength-first WBS algorithm based on the auxiliary graph (WFAUG) and the waveband-first WBS algorithm based on the auxiliary graph (BFAUG). Our results show that the WFAUG algorithm outperforms the BFAUG algorithm.

SimSight: A Virtual Machine Based Dynamic Call Graph Generator

One problem with using component-based software development approach is that once software modules are reused over generations of products, they form legacy structures that can be challenging to understand, making validating these systems difficult. Therefore, tools and methodologies that enable engineers to see interactions of these software modules will enhance their ability to make these software systems more dependable. To address this need, we propose SimSight, a framework to capture dynamic call graphs in Simics, a widely adopted commercial full-system simulator. Simics is a software system that simulates complete computer systems. Thus, it performs nearly identical tasks to a real system but at a much lower speed while providing greater execution observability. We have implemented SimSight to generate dynamic call graphs of statically and dynamically linked functions in x86/Linux environment. A case study illustrates how we can use SimSight to identify sources of software errors. We then evaluate its performance using 12 integer programs from SPEC CPU2006 benchmark suite.

Analyzing the Complexity and Reliability of Switch-Frequency-Reconfigurable Antennas Using Graph Models

This paper addresses the functional reliability and the complexity of reconfigurable antennas using graph models. The correlation between complexity and reliability for any given reconfigurable antenna is defined. Two methods are proposed to reduce failures and improve the reliability of reconfigurable antennas. The failures are caused by the reconfiguration technique or by the surrounding environment. These failure reduction methods proposed are tested and examples are given which verify these methods.

Connections between the Sznajd model with general confidence rules and graph theory

The Sznajd model is a sociophysics model that is used to model opinion propagation and consensus formation in societies. Its main feature is that its rules favor bigger groups of agreeing people. In a previous work, we generalized the bounded confidence rule in order to model biases and prejudices in discrete opinion models. In that work, we applied this modification to the Sznajd model and presented some preliminary results. The present work extends what we did in that paper. We present results linking many of the properties of the mean-field fixed points, with only a few qualitative aspects of the confidence rule (the biases and prejudices modeled), finding an interesting connection with graph theory problems. More precisely, we link the existence of fixed points with the notion of strongly connected graphs and the stability of fixed points with the problem of finding the maximal independent sets of a graph. We state these results and present comparisons between the mean field and simulations in Barabasi-Albert networks, followed by the main mathematical ideas and appendices with the rigorous proofs of our claims and some graph theory concepts, together with examples. We also show that there is no qualitative difference in the mean-field results if we require that a group of size q > 2, instead of a pair, of agreeing agents be formed before they attempt to convince other sites (for the mean field, this would coincide with the q-voter model).

Towards automated first-order abduction: the cut-based approach

Traditional abduction imposes as a precondition the restriction that the background information may not derive the goal data. In first-order logic such precondition is, in general, undecidable. To avoid such problem, we present a first-order cut-based abduction method, which has KE-tableaux as its underlying inference system. This inference system allows for the automation of non-analytic proofs in a tableau setting, which permits a generalization of traditional abduction that avoids the undecidable precondition problem. After demonstrating the correctness of the method, we show how this method can be dynamically iterated in a process that leads to the construction of non-analytic first-order proofs and, in some terminating cases, to refutations as well.

Algebraic-graph method for identification of islanding in power system grids

In this paper, a new algebraic-graph method for identification of islanding in power system grids is proposed. The proposed method identifies all the possible cases of islanding, due to the loss of a equipment, by means of a factorization of the bus-branch incidence matrix. The main features of this new method include: (i) simple implementation, (ii) high speed, (iii) real-time adaptability, (iv) identification of all islanding cases and (v) identification of the buses that compose each island in case of island formation. The method was successfully tested on large-scale systems such as the reduced south Brazilian system (45 buses/72 branches) and the south-southeast Brazilian system (810 buses/1340 branches). (C) 2011 Elsevier Ltd. All rights reserved.

Multivariate analysis of fresh-cut carambola slices stored under different temperatures

Quality of fresh-cut carambola (Averrhoa carambola L) is related to many chemical and biochemical variables especially those involved with softening and browning, both influenced by storage temperature. To study these effects, a multivariate analysis was used to evaluate slices packaged in vacuum-sealed polyolefin bags, and stored at 2.5 degrees C, 5 degrees C and 10 degrees C, for up to 16 d. The quality of slices at each temperature was correlated with the duration of storage, O(2) and CO(2) concentration in the package, physical chemical constituents, and activity of enzymes involved in softening (PG) and browning (PPO) metabolism. Three quality groups were identified by hierarchical cluster analysis, and the classification of the components within each of these groups was obtained from a principal component analysis (PCA). The characterization of samples by PCA clearly distinguished acceptable and non-acceptable slices. According to PCA, acceptable slices presented higher ascorbic acid content, greater hue angles ((o)h) and final lightness (L-5) in the first principal component (PC1). On the other hand, non-acceptable slices presented higher total pectin content. PPO activity in the PC1. Non-acceptable slices also presented higher soluble pectin content, increased pectin solubilisation and higher CO(2) concentration in the second principal component (PC2) whereas acceptable slices showed lower total sugar content. The hierarchical cluster and PCA analyses were useful for discriminating the quality of slices stored at different temperatures. (C) 2011 Elsevier B.V. All rights reserved.

A graph-theoretical approach in brain functional networks. Possible implications in EEG studies

Abstract Background Recently, it was realized that the functional connectivity networks estimated from actual brain-imaging technologies (MEG, fMRI and EEG) can be analyzed by means of the graph theory, that is a mathematical representation of a network, which is essentially reduced to nodes and connections between them. Methods We used high-resolution EEG technology to enhance the poor spatial information of the EEG activity on the scalp and it gives a measure of the electrical activity on the cortical surface. Afterwards, we used the Directed Transfer Function (DTF) that is a multivariate spectral measure for the estimation of the directional influences between any given pair of channels in a multivariate dataset. Finally, a graph theoretical approach was used to model the brain networks as graphs. These methods were used to analyze the structure of cortical connectivity during the attempt to move a paralyzed limb in a group (N=5) of spinal cord injured patients and during the movement execution in a group (N=5) of healthy subjects. Results Analysis performed on the cortical networks estimated from the group of normal and SCI patients revealed that both groups present few nodes with a high out-degree value (i.e. outgoing links). This property is valid in the networks estimated for all the frequency bands investigated. In particular, cingulate motor areas (CMAs) ROIs act as ‘‘hubs’’ for the outflow of information in both groups, SCI and healthy. Results also suggest that spinal cord injuries affect the functional architecture of the cortical network sub-serving the volition of motor acts mainly in its local feature property. In particular, a higher local efficiency El can be observed in the SCI patients for three frequency bands, theta (3-6 Hz), alpha (7-12 Hz) and beta (13-29 Hz). By taking into account all the possible pathways between different ROI couples, we were able to separate clearly the network properties of the SCI group from the CTRL group. In particular, we report a sort of compensatory mechanism in the SCI patients for the Theta (3-6 Hz) frequency band, indicating a higher level of “activation” Ω within the cortical network during the motor task. The activation index is directly related to diffusion, a type of dynamics that underlies several biological systems including possible spreading of neuronal activation across several cortical regions. Conclusions The present study aims at demonstrating the possible applications of graph theoretical approaches in the analyses of brain functional connectivity from EEG signals. In particular, the methodological aspects of the i) cortical activity from scalp EEG signals, ii) functional connectivity estimations iii) graph theoretical indexes are emphasized in the present paper to show their impact in a real application.

Uma nova abordagem branch and cut aplicada ao problema de planejamento da expansão de redes de transmissão de grande porte

Neste artigo propomos um algoritmo branch and cut com novas inequações específicas ao problema de planejamento da expansão de redes de transmissão de energia elétrica. Todas as inequações propostas neste trabalho são válidas tanto para os modelos lineares como para os modelos não lineares do problema. Os testes computacionais têm mostrado a eficiência do método proposto neste trabalho quando aplicado a subsistemas reais brasileiros e ao sistema colombiano.

Labeling the nodes in the intrinsic order graph with their weights

[EN] This paper deals with the study of some new properties of the intrinsic order graph. The intrinsic order graph is the natural graphical representation of a complex stochastic Boolean system (CSBS). A CSBS is a system depending on an arbitrarily large number n of mutually independent random Boolean variables. The intrinsic order graph displays its 2n vertices (associated to the CSBS) from top to bottom, in decreasing order of their occurrence probabilities. New relations between the intrinsic ordering and the Hamming weight (i.e., the number of 1-bits in a binary n-tuple) are derived. Further, the distribution of the weights of the 2n nodes in the intrinsic order graph is analyzed…

Complex sochastic boolean systems : new properties of the intrinsic order graph

[EN]A complex stochastic Boolean system (CSBS) is a system depending on an arbitrary number n of stochastic Boolean variables. The analysis of CSBSs is mainly based on the intrinsic order: a partial order relation defined on the set f0; 1gn of binary n-tuples. The usual graphical representation for a CSBS is the intrinsic order graph: the Hasse diagram of the intrinsic order. In this paper, some new properties of the intrinsic order graph are studied. Particularly, the set and the number of its edges, the degree and neighbors of each vertex, as well as typical properties, such as the symmetry and fractal structure of this graph, are analyzed…