Instability of anthocyanin accumulation in Vitis vinifera L. var. Gamay Freaux suspension cultures

The inherent instability of metabolite production in plant cell culture-based bioprocessing is a major problem hindering its commercialization. To understand the extent and causes of this instability, this study was aimed at understanding the variability of anthocyanin accumulation during long-term subcultures, as well as within subculture batches, in Vitis vinifera cell cultures. Therefore, four cell line suspensions of Vitis vinitera L. var. Gamay Freaux, A, B, C and D, originated from the same callus by cell-aggregate cloning, were established with starting anthocyanin contents of 2.73 +/- 0.15, 1.45 +/- 0.04, 0.77 +/- 0.024 and 0.27 +/- 0.04 CV (Color Value)/g-FCW (fresh cell weight), respectively. During weekly subculturing of 33 batches over 8 months, the anthocyanin biosynthetic capacity was gradually lost at various rates, for all four cell lines, regardless of the significant difference in the starting anthocyanin content. Contrary to this general trend, a significant fluctuation in the anthocyanin content was observed, but with an irregular cyclic pattern. The variabilities in the anthocyanin content between the subcultures for the 33 batches, as represented by the variation coefficient (VC), were 58, 57, 54, and 84% for V vinifera cell lines A, B, C and D, respectively. Within one subculture, the VCs from 12 replicate flasks for each of 12 independent subcultures were averaged, and found to be 9.7%, ranging from 4 to 17%. High- and low-producing cell lines, VV05 and VV06, with 1.8-fold differences in their basal anthocyanin contents, exhibited different inducibilities to L-phenylalanine feeding, methyl jasmonate and light irradiation. The low-producing cell line, showed greater potential in enhanced the anthocyanin production.

GABAA receptor chloride channels are involved in the neuroprotective role of GABA following oxygen and glucose deprivation in the rat cerebral cortex but not in the hippocampus.

Assays on "ex vivo" sections of rat hippocampus and rat cerebral cortex, subjected to oxygen and glucose deprivation (OGD) and a three-hour reperfusion-like (RL) recovery, were performed in the presence of either GABA or the GABA(A) receptor binding site antagonist, bicuculline. Lactate dehydrogenase (LDH) and propidium iodide were used to quantify cell mortality. We also measured, using real-time quantitative polymerase chain reaction (qPCR), the early transcriptional response of a number of genes of the glutamatergic and GABAergic systems. Specifically, glial pre- and post-synaptic glutamatergic transporters (namely GLAST1a, EAAC-1, GLT-1 and VGLUT1), three GABAA receptor subunits (α1, β2 and γ2), and the GABAergic presynaptic marker, glutamic acid decarboxylase (GAD65), were studied. Mortality assays revealed that GABAA receptor chloride channels play an important role in the neuroprotective effect of GABA in the cerebral cortex, but have a much smaller effect in the hippocampus. We also found that GABA reverses the OGD-dependent decrease in GABA(A) receptor transcript levels, as well as mRNA levels of the membrane and vesicular glutamate transporter genes. Based on the markers used, we conclude that OGD results in differential responses in the GABAergic presynaptic and postsynaptic systems.

Gastroprotective potential of Buddleja scordioides Kunth: Effects into the modulation of antioxidant enzymes and inflammation markers in an in vivo model

Ethnopharmacological relevance: A common plant used to treat several gastric disorders is Buddleja scordioides Kunth,commonly known as salvilla. Aim of thes tudy: To detect inflammatory markers,in order to evaluate the gastroprotective potential of salvilla infusions,as this could have beneficial impact on the population exposed to gastric ulcers and colitis. Materials and methods: The present work attempted infusions were prepared with B. scordioides (1% w/w) lyophilized and stored.Total phenolic content and GC–MS analysis were performed. Wistar rats were divided into five groups a negative vehicle control,an indomethacin group,and three experimental groups,named preventive,curative,and suppressive. All rats were sacrificed under deep ether anesthesia(6h)after the last oral administration of indomethacin/infusion.The rat stomachs were promptly excised,weighed,and chilled in ice-cold and 0.9%NaCl.Histological analysis,nitrites quantification and immunodetection assays were done. Results: B.scordioides infusions markedly reduced the visible hemorrhagic lesions induced byindomethacin in rat stomachs,also showed down-regulation of COX2, IL-8 and TNFα and up-regulation of COX-1with a moderate down-regulation of NFkB and lower amount of nitrites.However,this behavior was dependent on the treatment,showing most down-regulation of COX-2,TNFα and IL-8 in the curative treatment;more down-regulation of NF-kB in the preventive treatment;and more up-regulation of COX-1 for the suppressor and preventive treatments. Conclusion: The anti-inflammatory potential of B. scordioides infusions could be related with the presence of polyphenols as quercetin in the infusion and how this one is consumed.

The Paston Women: Selected Letters

Watt, D. (Ed.). (2004). The Paston Women: Selected Letters. Library of Medieval Women. Rochester: D. S. Brewer. RAE2008

Síndrome de Burnout em farmacêuticos

Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Ciências Farmacêuticas

Tejeduría en telar vertical en lana virgen Quizgó y Pitayó, Cauca.

42 hojas : ilustraciones, fotografías a color.

A Pragmatic Approach to DHT Adoption

Despite the peer-to-peer community's obvious wish to have its systems adopted, specific mechanisms to facilitate incremental adoption have not yet received the same level of attention as the many other practical concerns associated with these systems. This paper argues that ease of adoption should be elevated to a first-class concern and accordingly presents HOLD, a front-end to existing DHTs that is optimized for incremental adoption. Specifically, HOLD is backwards-compatible: it leverages DNS to provide a key-based routing service to existing Internet hosts without requiring them to install any software. This paper also presents applications that could benefit from HOLD as well as the trade-offs that accompany HOLD. Early implementation experience suggests that HOLD is practical.

On the Interaction between Data Aggregation and Topology Control in Wireless Sensor Networks

Wireless sensor networks are characterized by limited energy resources. To conserve energy, application-specific aggregation (fusion) of data reports from multiple sensors can be beneficial in reducing the amount of data flowing over the network. Furthermore, controlling the topology by scheduling the activity of nodes between active and sleep modes has often been used to uniformly distribute the energy consumption among all nodes by de-synchronizing their activities. We present an integrated analytical model to study the joint performance of in-network aggregation and topology control. We define performance metrics that capture the tradeoffs among delay, energy, and fidelity of the aggregation. Our results indicate that to achieve high fidelity levels under medium to high event reporting load, shorter and fatter aggregation/routing trees (toward the sink) offer the best delay-energy tradeoff as long as topology control is well coordinated with routing.

Basis Token Consistency: A Practical Mechanism for Strong Web Cache Consistency

With web caching and cache-related services like CDNs and edge services playing an increasingly significant role in the modern internet, the problem of the weak consistency and coherence provisions in current web protocols is becoming increasingly significant and drawing the attention of the standards community [LCD01]. Toward this end, we present definitions of consistency and coherence for web-like environments, that is, distributed client-server information systems where the semantics of interactions with resource are more general than the read/write operations found in memory hierarchies and distributed file systems. We then present a brief review of proposed mechanisms which strengthen the consistency of caches in the web, focusing upon their conceptual contributions and their weaknesses in real-world practice. These insights motivate a new mechanism, which we call "Basis Token Consistency" or BTC; when implemented at the server, this mechanism allows any client (independent of the presence and conformity of any intermediaries) to maintain a self-consistent view of the server's state. This is accomplished by annotating responses with additional per-resource application information which allows client caches to recognize the obsolescence of currently cached entities and identify responses from other caches which are already stale in light of what has already been seen. The mechanism requires no deviation from the existing client-server communication model, and does not require servers to maintain any additional per-client state. We discuss how our mechanism could be integrated into a fragment-assembling Content Management System (CMS), and present a simulation-driven performance comparison between the BTC algorithm and the use of the Time-To-Live (TTL) heuristic.

Cache-and-Relay Streaming Media Delivery for Asynchronous Clients

We consider the problem of delivering popular streaming media to a large number of asynchronous clients. We propose and evaluate a cache-and-relay end-system multicast approach, whereby a client joining a multicast session caches the stream, and if needed, relays that stream to neighboring clients which may join the multicast session at some later time. This cache-and-relay approach is fully distributed, scalable, and efficient in terms of network link cost. In this paper we analytically derive bounds on the network link cost of our cache-and-relay approach, and we evaluate its performance under assumptions of limited client bandwidth and limited client cache capacity. When client bandwidth is limited, we show that although finding an optimal solution is NP-hard, a simple greedy algorithm performs surprisingly well in that it incurs network link costs that are very close to a theoretical lower bound. When client cache capacity is limited, we show that our cache-and-relay approach can still significantly reduce network link cost. We have evaluated our cache-and-relay approach using simulations over large, synthetic random networks, power-law degree networks, and small-world networks, as well as over large real router-level Internet maps.

Service Provisioning in Mobile Networks Through Distributed Coordinated Resource Management

The pervasiveness of personal computing platforms offers an unprecedented opportunity to deploy large-scale services that are distributed over wide physical spaces. Two major challenges face the deployment of such services: the often resource-limited nature of these platforms, and the necessity of preserving the autonomy of the owner of these devices. These challenges preclude using centralized control and preclude considering services that are subject to performance guarantees. To that end, this thesis advances a number of new distributed resource management techniques that are shown to be effective in such settings, focusing on two application domains: distributed Field Monitoring Applications (FMAs), and Message Delivery Applications (MDAs). In the context of FMA, this thesis presents two techniques that are well-suited to the fairly limited storage and power resources of autonomously mobile sensor nodes. The first technique relies on amorphous placement of sensory data through the use of novel storage management and sample diffusion techniques. The second approach relies on an information-theoretic framework to optimize local resource management decisions. Both approaches are proactive in that they aim to provide nodes with a view of the monitored field that reflects the characteristics of queries over that field, enabling them to handle more queries locally, and thus reduce communication overheads. Then, this thesis recognizes node mobility as a resource to be leveraged, and in that respect proposes novel mobility coordination techniques for FMAs and MDAs. Assuming that node mobility is governed by a spatio-temporal schedule featuring some slack, this thesis presents novel algorithms of various computational complexities to orchestrate the use of this slack to improve the performance of supported applications. The findings in this thesis, which are supported by analysis and extensive simulations, highlight the importance of two general design principles for distributed systems. First, a-priori knowledge (e.g., about the target phenomena of FMAs and/or the workload of either FMAs or DMAs) could be used effectively for local resource management. Second, judicious leverage and coordination of node mobility could lead to significant performance gains for distributed applications deployed over resource-impoverished infrastructures.

Nearest-neighbor Queries in Probabilistic Graphs

Large probabilistic graphs arise in various domains spanning from social networks to biological and communication networks. An important query in these graphs is the k nearest-neighbor query, which involves finding and reporting the k closest nodes to a specific node. This query assumes the existence of a measure of the "proximity" or the "distance" between any two nodes in the graph. To that end, we propose various novel distance functions that extend well known notions of classical graph theory, such as shortest paths and random walks. We argue that many meaningful distance functions are computationally intractable to compute exactly. Thus, in order to process nearest-neighbor queries, we resort to Monte Carlo sampling and exploit novel graph-transformation ideas and pruning opportunities. In our extensive experimental analysis, we explore the trade-offs of our approximation algorithms and demonstrate that they scale well on real-world probabilistic graphs with tens of millions of edges.

Region Segmentation via Deformable Model-Guided Split and Merge

An improved method for deformable shape-based image segmentation is described. Image regions are merged together and/or split apart, based on their agreement with an a priori distribution on the global deformation parameters for a shape template. The quality of a candidate region merging is evaluated by a cost measure that includes: homogeneity of image properties within the combined region, degree of overlap with a deformed shape model, and a deformation likelihood term. Perceptually-motivated criteria are used to determine where/how to split regions, based on the local shape properties of the region group's bounding contour. A globally consistent interpretation is determined in part by the minimum description length principle. Experiments show that the model-based splitting strategy yields a significant improvement in segmention over a method that uses merging alone.

Facial Feature Tracking and Occlusion Recovery in American Sign Language

Facial features play an important role in expressing grammatical information in signed languages, including American Sign Language(ASL). Gestures such as raising or furrowing the eyebrows are key indicators of constructions such as yes-no questions. Periodic head movements (nods and shakes) are also an essential part of the expression of syntactic information, such as negation (associated with a side-to-side headshake). Therefore, identification of these facial gestures is essential to sign language recognition. One problem with detection of such grammatical indicators is occlusion recovery. If the signer's hand blocks his/her eyebrows during production of a sign, it becomes difficult to track the eyebrows. We have developed a system to detect such grammatical markers in ASL that recovers promptly from occlusion. Our system detects and tracks evolving templates of facial features, which are based on an anthropometric face model, and interprets the geometric relationships of these templates to identify grammatical markers. It was tested on a variety of ASL sentences signed by various Deaf native signers and detected facial gestures used to express grammatical information, such as raised and furrowed eyebrows as well as headshakes.

Spatiotemporal Gesture Segmentation

Spotting patterns of interest in an input signal is a very useful task in many different fields including medicine, bioinformatics, economics, speech recognition and computer vision. Example instances of this problem include spotting an object of interest in an image (e.g., a tumor), a pattern of interest in a time-varying signal (e.g., audio analysis), or an object of interest moving in a specific way (e.g., a human's body gesture). Traditional spotting methods, which are based on Dynamic Time Warping or hidden Markov models, use some variant of dynamic programming to register the pattern and the input while accounting for temporal variation between them. At the same time, those methods often suffer from several shortcomings: they may give meaningless solutions when input observations are unreliable or ambiguous, they require a high complexity search across the whole input signal, and they may give incorrect solutions if some patterns appear as smaller parts within other patterns. In this thesis, we develop a framework that addresses these three problems, and evaluate the framework's performance in spotting and recognizing hand gestures in video. The first contribution is a spatiotemporal matching algorithm that extends the dynamic programming formulation to accommodate multiple candidate hand detections in every video frame. The algorithm finds the best alignment between the gesture model and the input, and simultaneously locates the best candidate hand detection in every frame. This allows for a gesture to be recognized even when the hand location is highly ambiguous. The second contribution is a pruning method that uses model-specific classifiers to reject dynamic programming hypotheses with a poor match between the input and model. Pruning improves the efficiency of the spatiotemporal matching algorithm, and in some cases may improve the recognition accuracy. The pruning classifiers are learned from training data, and cross-validation is used to reduce the chance of overpruning. The third contribution is a subgesture reasoning process that models the fact that some gesture models can falsely match parts of other, longer gestures. By integrating subgesture reasoning the spotting algorithm can avoid the premature detection of a subgesture when the longer gesture is actually being performed. Subgesture relations between pairs of gestures are automatically learned from training data. The performance of the approach is evaluated on two challenging video datasets: hand-signed digits gestured by users wearing short sleeved shirts, in front of a cluttered background, and American Sign Language (ASL) utterances gestured by ASL native signers. The experiments demonstrate that the proposed method is more accurate and efficient than competing approaches. The proposed approach can be generally applied to alignment or search problems with multiple input observations, that use dynamic programming to find a solution.