Altered of apoptotic markers of both extrinsic and intrinsic pathways induced by hepatitis C virus infection in peripheral blood mononuclear cells

Background: Chronic hepatitis C (CHC) has emerged as a leading cause of cirrhosis in the U. S. and across the world. To understand the role of apoptotic pathways in hepatitis C virus (HCV) infection, we studied the mRNA and protein expression patterns of apoptosis-related genes in peripheral blood mononuclear cells (PBMC) obtained from patients with HCV infection.Methods: the present study included 50 subjects which plasma samples were positive for HCV, but negative for human immunodeficiency virus (HIV) or hepatitis B virus (HBV). These cases were divided into four groups according to METAVIR, a score-based analysis which helps to interpret a liver biopsy according to the degree of inflammation and fibrosis. mRNA expression of the studied genes were analyzed by reverse transcription of quantitative polymerase chain reaction (RT-qPCR) and protein levels, analyzed by ELISA, was also conducted. HCV genotyping was also determined.Results: HCV infection increased mRNA expression and protein synthesis of caspase 8 in group 1 by 3 fold and 4 fold, respectively (p < 0.05). in group 4 HCV infection increased mRNA expression and protein synthesis of caspase 9 by 2 fold and 1,5 fold, respectively (p < 0.05). Also, caspase 3 mRNA expression and protein synthesis had level augumented by HCV infection in group 1 by 4 fold and 5 fold, respectively, and in group 4 by 6 fold and 7 fold, respectively (p < 0.05).Conclusions: HCV induces alteration at both genomic and protein levels of apoptosis markers involved with extrinsic and intrinsic pathways.

Reference genes for quantitative RT-PCR data in gastric tissues and cell lines

AIM: To evaluate the suitability of reference genes in gastric tissue samples and cell lines.METHODS: the suitability of genes ACTB, B2M, GAPDH, RPL29, and 18S rRNA was assessed in 21 matched pairs of neoplastic and adjacent nonneoplastic gastric tissues from patients with gastric adenocarcinoma, 27 normal gastric tissues from patients without cancer, and 4 cell lines using reverse transcription quantitative real-time polymerase chain reaction (RT-qPCR). the ranking of the best single and combination of reference genes was determined by NormFinder, geNorm (TM), BestKeeper, and DataAssist (TM). in addition, GenEx software was used to determine the optimal number of reference genes. To validate the results, the mRNA expression of a target gene, DNMT1, was quantified using the different reference gene combinations suggested by the various software packages for normalization.RESULTS: ACTB was the best reference gene for all gastric tissues, cell lines and all gastric tissues plus cell lines. GAPDH + B2M or ACTB + B2M was the best combination of reference genes for all the gastric tissues. On the other hand, ACTB + B2M was the best combination for all the cell lines tested and was also the best combination for analyses involving all the gastric tissues plus cell lines. According to the GenEx software, 2 or 3 genes were the optimal number of references genes for all the gastric tissues. the relative quantification of DNMT1 showed similar patterns when normalized by each combination of reference genes. the level of expression of DNMT1 in neoplastic, adjacent non-neoplastic and normal gastric tissues did not differ when these samples were normalized using GAPDH + B2M (P = 0.32), ACTB + B2M (P = 0.61), or GAPDH + B2M + ACTB (P = 0.44).CONCLUSION: GAPDH + B2M or ACTB + B2M is the best combination of reference gene for all the gastric tissues, and ACTB + B2M is the best combination for the cell lines tested. (C) 2013 Baishideng Publishing Group Co., Limited. All rights reserved.

Fragments of place : revealing sense of place through shared phone images.

Is an interactive new media art installation that explores how the sharing of images, normally hidden on mobile phones, can reveal more about people's sense of place and this ultimately shared experience. Traditional views on sense of place, as exemplified by Wagner (1972) and Relph (1976), characterise the experience as a fusion of meaning, act and context. Indeed, Relph suggests that it is not just the identity of a place that is important, but also the identity that a person or group has with that place, in particular whether they are experiencing it as an ‘insider’ or ‘outsider’. This work stimulates debate concerning the impact of technology on sense of place. Technology offers a number of bridges between the real and virtual worlds, but in so doing places an increased tension on the sense of place and subsequently the identity of the individual. This, coupled with the increased use of camera phones, has enabled the documentation of all aspects of our lives, the things we do, the objects we encounter and the places we inhabit. The installation taps into these hidden electronic resources by letting people share their sense of place associated with a large scale event. The work explores the changing nature of the sense of place of performers, visitors and residents over the duration of the event. Interaction with the installation will transform the viewer into performer, echoing Relph’s insider-outsider dichotomy

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.

Leaving Planet Earth (Follow-on Voucher Project).

SFC FOLLOW-ON VOUCHER The project was undertaken as a SFC Follow-on Voucher (£40K) alongside a student project with BDes (Hons) Design & Digital Arts (D&DA).James Blake (Centre for Media & Culture) brought together students and staff to develop digital content, including films, for a transmedia project and the induction video on the coaches to Ratho. Malcolm Innes, Ian Lambert, Andrew O’Dowd, and Euan Winton (Centre for Design Practice & Research) developed the Old Earth Museum (both physical and virtual), and transmedia designer and research student Beata Zemanek oversaw the transmedia strategy and making of the Gatekeeper film, supported by D&DA students and graduates.

Optimization of physical and optical properties of biodegradable edible films based on pea starch and guar gum

The influence of process variables (pea starch, guar gum and glycerol) on the viscosity (V), solubility (SOL), moisture content (MC), transparency (TR), Hunter parameters (L, a, and b), total color difference (ΔE), yellowness index (YI), and whiteness index (WI) of the pea starch based edible films was studied using three factors with three level Box–Behnken response surface design. The individual linear effect of pea starch, guar and glycerol was significant (p < 0.05) on all the responses. However, a value was only significantly (p < 0.05) affected by pea starch and guar gum in a positive and negative linear term, respectively. The effect of interaction of starch × glycerol was also significant (p < 0.05) on TR of edible films. Interaction between independent variables starch × guar gum had a significant impact on the b and YI values. The quadratic regression coefficient of pea starch showed a significant effect (p < 0.05) on V, MC, L, b, ΔE, YI, and WI; glycerol level on ΔE and WI; and guar gum on ΔE and SOL value. The results were analyzed by Pareto analysis of variance (ANOVA) and the second order polynomial models were developed from the experimental design with reliable and satisfactory fit with the corresponding experimental data and high coefficient of determination (R2) values (>0.93). Three-dimensional response surface plots were established to investigate the relationship between process variables and the responses. The optimized conditions with the goal of maximizing TR and minimizing SOL, YI and MC were 2.5 g pea starch, 25% glycerol and 0.3 g guar gum. Results revealed that pea starch/guar gum edible films with appropriate physical and optical characteristics can be effectively produced and successfully applied in the food packaging industry.

Influencia del sexo en la transmisión vertical del nucleopoliedrovirus de Spodoptera exigua (SeMNPV-Al1)

El ciclo ecológico de los baculovirus comprende dos vías de transmisión: la horizontal que se produce entre congéneres y la vertical, que implica el paso de genomas virales de los parentales a la progenie. Recientemente se ha estudiado la efectiva transmisión vertical del Nucleopoliedrovirus de Spodoptera exigua (SeMNPV-Al1) en una población de su húesped de los invernaderos de Almería (España). La detección de progenie infectada de hembras sanas, sugiere la necesidad de determinar el papel que juegan ambos sexos en la transmisión del virus. En el presente trabajo se establecieron infecciones subletales para obtener adultos con infecciones encubiertas y utilizando un esquema de apareamientos entre adultos sanos e infectados se verificó que la transmisión del virus es posible vía paterna o materna. La vía materna parece más constante en su respuesta de acuerdo a la medición de la carga viral obtenida en la descendencia (qPCR). El tratamiento de desinfección de la puesta no afectó a la detección de ADN viral en la descendencia, lo que sugiere una transmisión transovo. La carga viral por insecto fue similar independientemente del sexo de los parentales y la descendencia masculina y femenina se vio afectada de igual manera por la infección.

Quadsim Version 2.1 Student Manual

Quadsim is an intermediate code simulator. It allows you to "run" programs that your compiler generates in intermediate code format. Its user interface is similar to most debuggers in that you can step through your program, instruction by instruction, set breakpoints, examine variable values, and so on. The intermediate code format used by Quadsim is that described in [Aho 86]. If your compiler generates intermediate code in this format, you will be able to take intermediate-code files generated by your compiler, load them into the simulator, and watch them "run." You are provided with functions that hide the internal representation of intermediate code. You can use these functions within your compiler to generate intermediate code files that can be read by the simulator. Quadsim was inspired and greatly influenced by [Aho 86]. The material in chapter 8 (Intermediate Code Generation) of [Aho 86] should be considered background material for users of Quadsim.

Performance Evaluation of Two-Shadow Speculative Concurrency Control

Speculative Concurrency Control (SCC) [Best92a] is a new concurrency control approach especially suited for real-time database applications. It relies on the use of redundancy to ensure that serializable schedules are discovered and adopted as early as possible, thus increasing the likelihood of the timely commitment of transactions with strict timing constraints. In [Best92b], SCC-nS, a generic algorithm that characterizes a family of SCC-based algorithms was described, and its correctness established by showing that it only admits serializable histories. In this paper, we evaluate the performance of the Two-Shadow SCC algorithm (SCC-2S), a member of the SCC-nS family, which is notable for its minimal use of redundancy. In particular, we show that SCC-2S (as a representative of SCC-based algorithms) provides significant performance gains over the widely used Optimistic Concurrency Control with Broadcast Commit (OCC-BC), under a variety of operating conditions and workloads.

Proceedings of Sixth International Workshop on Unification

Swiss National Science Foundation; Austrian Federal Ministry of Science and Research; Deutsche Forschungsgemeinschaft (SFB 314); Christ Church, Oxford; Oxford University Computing Laboratory

Mermera: Non-Coherent Distributed Shared Memory for Parallel Computing

The proliferation of inexpensive workstations and networks has prompted several researchers to use such distributed systems for parallel computing. Attempts have been made to offer a shared-memory programming model on such distributed memory computers. Most systems provide a shared-memory that is coherent in that all processes that use it agree on the order of all memory events. This dissertation explores the possibility of a significant improvement in the performance of some applications when they use non-coherent memory. First, a new formal model to describe existing non-coherent memories is developed. I use this model to prove that certain problems can be solved using asynchronous iterative algorithms on shared-memory in which the coherence constraints are substantially relaxed. In the course of the development of the model I discovered a new type of non-coherent behavior called Local Consistency. Second, a programming model, Mermera, is proposed. It provides programmers with a choice of hierarchically related non-coherent behaviors along with one coherent behavior. Thus, one can trade-off the ease of programming with coherent memory for improved performance with non-coherent memory. As an example, I present a program to solve a linear system of equations using an asynchronous iterative algorithm. This program uses all the behaviors offered by Mermera. Third, I describe the implementation of Mermera on a BBN Butterfly TC2000 and on a network of workstations. The performance of a version of the equation solving program that uses all the behaviors of Mermera is compared with that of a version that uses coherent behavior only. For a system of 1000 equations the former exhibits at least a 5-fold improvement in convergence time over the latter. The version using coherent behavior only does not benefit from employing more than one workstation to solve the problem while the program using non-coherent behavior continues to achieve improved performance as the number of workstations is increased from 1 to 6. This measurement corroborates our belief that non-coherent shared memory can be a performance boon for some applications.

An Implementation of Mermera: A Shared Memory System that Mixes Coherence with Non-coherence

Coherent shared memory is a convenient, but inefficient, method of inter-process communication for parallel programs. By contrast, message passing can be less convenient, but more efficient. To get the benefits of both models, several non-coherent memory behaviors have recently been proposed in the literature. We present an implementation of Mermera, a shared memory system that supports both coherent and non-coherent behaviors in a manner that enables programmers to mix multiple behaviors in the same program[HS93]. A programmer can debug a Mermera program using coherent memory, and then improve its performance by selectively reducing the level of coherence in the parts that are critical to performance. Mermera permits a trade-off of coherence for performance. We analyze this trade-off through measurements of our implementation, and by an example that illustrates the style of programming needed to exploit non-coherence. We find that, even on a small network of workstations, the performance advantage of non-coherence is compelling. Raw non-coherent memory operations perform 20-40~times better than non-coherent memory operations. An example application program is shown to run 5-11~times faster when permitted to exploit non-coherence. We conclude by commenting on our use of the Isis Toolkit of multicast protocols in implementing Mermera.

On Learning Counting Functions With Queries

We investigate the problem of learning disjunctions of counting functions, which are general cases of parity and modulo functions, with equivalence and membership queries. We prove that, for any prime number p, the class of disjunctions of integer-weighted counting functions with modulus p over the domain Znq (or Zn) for any given integer q ≥ 2 is polynomial time learnable using at most n + 1 equivalence queries, where the hypotheses issued by the learner are disjunctions of at most n counting functions with weights from Zp. The result is obtained through learning linear systems over an arbitrary field. In general a counting function may have a composite modulus. We prove that, for any given integer q ≥ 2, over the domain Zn2, the class of read-once disjunctions of Boolean-weighted counting functions with modulus q is polynomial time learnable with only one equivalence query, and the class of disjunctions of log log n Boolean-weighted counting functions with modulus q is polynomial time learnable. Finally, we present an algorithm for learning graph-based counting functions.

Mapping Parallel Iterative Algorithms onto Workstation Networks

For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work [HPS94], we showed experimentally that the performance of certain parallel applications running on a workstation network can be improved significantly if a congestion control protocol is used to enhance network performance. In this paper, we characterize and analyze the communication requirements of a large class of supercomputing applications that fall under the category of fixed-point problems, amenable to solution by parallel iterative methods. This results in a set of interface and architectural features sufficient for the efficient implementation of the applications over a large-scale distributed system. In particular, we propose a direct link between the application and network layer, supporting congestion control actions at both ends. This in turn enhances the system's responsiveness to network congestion, improving performance. Measurements are given showing the efficacy of our scheme to support large-scale parallel computations.

A Hybrid GLR Algorithm for Parsing with Epsilon Grammars

We give a hybrid algorithm for parsing epsilon grammars based on Tomita's non-ϵ-grammar parsing algorithm ([Tom86]) and Nozohoor-Farshi's ϵ-grammar recognition algorithm ([NF91]). The hybrid parser handles the same set of grammars handled by Nozohoor-Farshi's recognizer. The algorithm's details and an example of its use are given. We also discuss the deployment of the hybrid algorithm within a GB parser, and the reason an ϵ grammar parser is needed in our GB parser.