Regulation of extracellular matrix genes by arecoline in primary gingival fibroblasts requires epithelial factors

Background and Objective: Oral submucous fibrosis, a disease of collagen disorder, has been attributed to arecoline present in the saliva of betel quid chewers. However, the molecular basis of the action of arecoline in the pathogenesis of oral submucous fibrosis is poorly understood. The basic aim of our study was to elucidate the mechanism underlying the action of arecoline on the expression of genes in oral fibroblasts. Material and Methods: Human keratinocytes (HaCaT cells) and primary human gingival fibroblasts were treated with arecoline in combination with various pathway inhibitors, and the expression of transforming growth factor-beta isoform genes and of collagen isoforms was assessed using reverse transcription polymerase chain reaction analysis. Results: We observed the induction of transforming growth factor-beta2 by arecoline in HaCaT cells and this induction was found to be caused by activation of the M-3 muscarinic acid receptor via the induction of calcium and the protein kinase C pathway. Most importantly, we showed that transforming growth factor-beta2 was significantly overexpressed in oral submucous fibrosis tissues (p = 0.008), with a median of 2.13 (n = 21) compared with 0.75 (n = 18) in normal buccal mucosal tissues. Furthermore, arecoline down-regulated the expression of collagens 1A1 and 3A1 in human primary gingival fibroblasts; however these collagens were induced by arecoline in the presence of spent medium of cultured human keratinocytes. Treatment with a transforming growth factor-beta blocker, transforming growth factor-beta1 latency-associated peptide, reversed this up-regulation of collagen, suggesting a role for profibrotic cytokines, such as transforming growth factor-beta, in the induction of collagens. Conclusion: Taken together, our data highlight the importance of arecoline-induced epithelial changes in the pathogenesis of oral submucous fibrosis.

A Petri net model for evaluating packet buffering strategies in a network processor

Previous studies have shown that buffering packets in DRAM is a performance bottleneck. In order to understand the impediments in accessing the DRAM, we developed a detailed Petri net model of IP forwarding application on IXP2400 that models the different levels of the memory hierarchy. The cell based interface used to receive and transmit packets in a network processor leads to some small size DRAM accesses. Such narrow accesses to the DRAM expose the bank access latency, reducing the bandwidth that can be realized. With real traces up to 30% of the accesses are smaller than the cell size, resulting in 7.7% reduction in DRAM bandwidth. To overcome this problem, we propose buffering these small chunks of data in the on chip scratchpad memory. This scheme also exploits greater degree of parallelism between different levels of the memory hierarchy. Using real traces from the internet, we show that the transmit rate can be improved by an average of 21% over the base scheme without the use of additional hardware. Further, the impact of different traffic patterns on the network processor resources is studied. Under real traffic conditions, we show that the data bus which connects the off-chip packet buffer to the micro-engines, is the obstacle in achieving higher throughput.

Evaluation of Vestibular Function with Visual Feedback Posturography and Motorized Head Impulse Test.

Objectives: To evaluate the applicability of visual feedback posturography (VFP) for quantification of postural control, and to characterize the horizontal angular vestibulo-ocular reflex (AVOR) by use of a novel motorized head impulse test (MHIT). Methods: In VFP, subjects standing on a platform were instructed to move their center of gravity to symmetrically placed peripheral targets as fast and accurately as possible. The active postural control movements were measured in healthy subjects (n = 23), and in patients with vestibular schwannoma (VS) before surgery (n = 49), one month (n = 17), and three months (n = 36) after surgery. In MHIT we recorded head and eye position during motorized head impulses (mean velocity of 170º/s and acceleration of 1 550º/s²) in healthy subjects (n = 22), in patients with VS before surgery (n = 38) and about four months afterwards (n = 27). The gain, asymmetry and latency in MHIT were calculated. Results: The intraclass correlation coefficient for VFP parameters during repeated tests was significant (r = 0.78-0.96; p < 0.01), although two of four VFP parameters improved slightly during five test sessions in controls. At least one VFP parameter was abnormal pre- and postoperatively in almost half the patients, and these abnormal preoperative VFP results correlated significantly with abnormal postoperative results. The mean accuracy in postural control in patients was reduced pre- and postoperatively. A significant side difference with VFP was evident in 10% of patients. In the MHIT, the normal gain was close to unity, the asymmetry in gain was within 10%, and the latency was a mean ± standard deviation 3.4 ± 6.3 milliseconds. Ipsilateral gain or asymmetry in gain was preoperatively abnormal in 71% of patients, whereas it was abnormal in every patient after surgery. Preoperative gain (mean ± 95% confidence interval) was significantly lowered to 0.83 ± 0.08 on the ipsilateral side compared to 0.98 ± 0.06 on the contralateral side. The ipsilateral postoperative mean gain of 0.53 ± 0.05 was significantly different from preoperative gain. Conclusion: The VFP is a repeatable, quantitative method to assess active postural control within individual subjects. The mean postural control in patients with VS was disturbed before and after surgery, although not severely. Side difference in postural control in the VFP was rare. The horizontal AVOR results in healthy subjects and in patients with VS, measured with MHIT, were in agreement with published data achieved using other techniques with head impulse stimuli. The MHIT is a non-invasive method which allows reliable clinical assessment of the horizontal AVOR.

The Risk of Cancer Associated with Immunosuppressive Therapy for Skin Diseases

The possible carcinogenic risk of immunosuppressive therapies is an important issue in everyday clinical practise. Carcinogenesis is a slow multi step procedure, thus a long latency period is needed before cancer develops. PUVA therapy is used for many skin diseases including psoriasis, early stage cutaneous T cell lymphoma, atopic dermatitis, palmoplantar pustulosis and chronic eczema. There has been concern about the increased melanoma risk associated to PUVA therapy, which has previously been associated with an increased risk on non-melanoma skin cancer, especially squamous cell carcinoma. The increased risk of basal cell carcinoma (BCC) is also documented but it is modest compared to squamous cell carcinoma (SCC). This thesis evaluated melanoma and noncutaneous cancer risk associated to PUVA, and the persistence of nonmelanoma cancer risk after the cessation of PUVA treatment. Also, the influence of photochemotherapy to the development of secondary cancers in cutaneous T cell lymphoma and the role of short term cyclosporine in later cancer development in inflammatory skin diseases were evaluated. The first three studies were performed on psoriasis patients. The risk of melanoma started to increase 15 years after the first treatment with PUVA. The risk was highest among persons who had received over 250 treatments compared to those under 250 treatments. In noncutaneous cancer, the overall risk was not increased (RR=1.08,95% CI=0.93-1.24), but significant increases in risk were found in thyroid cancer, breast cancer and in central nervous system neoplasms. These cancers were not associated to PUVA. The increased risk of SCC was associated to high cumulative UVA exposure in the PUVA regimen. The patients with high risk had no substantial exposure to other carcinogens. In BCC there was a similar but more modest tendency. In the two other studies, the risk of all secondary cancers (SIR) in CTCL patients was 1.4 (95% CI=1.0-1.9). In separate sites, the risk of lung cancer, Hodgkin and non-Hodgkin lymphomas were increased. PUVA seemed not to contribute to any extent to the appearance of these cancers. The carcinogenity of short-term cyclosporine was evaluated in inflammatory skin diseases. No increased risk for any type of cancer including the skin cancers was detected. To conclude, our studies confirm the increased skin cancer risk related to PUVA treatment in psoriasis patients. In clinical practice, this has led to a close and permanent follow-up of patients treated with PUVA. In CTCL patients, PUVA treatment did not contribute to the development of secondary cancers. We could not detect any increase in the risk of cancer in patients treated with short term cyclosporine, unlike in organ transplant patients under such long-term therapy.

RECONNECT: A NoC for polymorphic ASICs using a low overhead single cycle router

A polymorphic ASIC is a runtime reconfigurable hardware substrate comprising compute and communication elements. It is a ldquofuture proofrdquo custom hardware solution for multiple applications and their derivatives in a domain. Interoperability between application derivatives at runtime is achieved through hardware reconfiguration. In this paper we present the design of a single cycle Network on Chip (NoC) router that is responsible for effecting runtime reconfiguration of the hardware substrate. The router design is optimized to avoid FIFO buffers at the input port and loop back at output crossbar. It provides virtual channels to emulate a non-blocking network and supports a simple X-Y relative addressing scheme to limit the control overhead to 9 bits per packet. The 8times8 honeycomb NoC (RECONNECT) implemented in 130 nm UMC CMOS standard cell library operates at 500 MHz and has a bisection bandwidth of 28.5 GBps. The network is characterized for random, self-similar and application specific traffic patterns that model the execution of multimedia and DSP kernels with varying network loads and virtual channels. Our implementation with 4 virtual channels has an average network latency of 24 clock cycles and throughput of 62.5% of the network capacity for random traffic. For application specific traffic the latency is 6 clock cycles and throughput is 87% of the network capacity.

Stress responses in mycobacteria

Mycobacterium tuberculosis is a successful pathogen that overcomes numerous challenges presented by the immune system of the host. This bacterium usually establishes a chronic infection in the host where it may silently persist inside a granuloma until, a failure in host defenses, leads to manifestation of the disease. None of the conventional anti-tuberculosis drugs are able to target these persisting bacilli. Development of drugs against such persisting bacilli is a constant challenge since the physiology of these dormant bacteria is still not understood at the molecular level. Some evidence suggests that the in vivo environment encountered by the persisting bacteria is anoxic and nutritionally starved. Based on these assumptions, anaerobic and starved cultures are used as models to study the molecular basis of dormancy. This review outlines the problem of persistence of M. tuberculosis and the various in vitro models used to study mycobacterial latency. The basis of selecting the nutritional starvation model has been outlined here. Also, the choice of M. smegmatis as a model suitable for studying mycobacterial latency is discussed. Lastly, general issues related to oxidative stress and bacterial responses to it have been elaborated. We have also discussed general control of OxyR-mediated regulation and emphasized the processes which manifest in the absence of functional OxyR in the bacteria. Lastly, a new class of protein called Dps has been reviewed for its important role in protecting DNA under stress.

A cost effective pipelined divider for double precision floating point number

he growth of high-performance application in computer graphics, signal processing and scientific computing is a key driver for high performance, fixed latency; pipelined floating point dividers. Solutions available in the literature use large lookup table for double precision floating point operations.In this paper, we propose a cost effective, fixed latency pipelined divider using modified Taylor-series expansion for double precision floating point operations. We reduce chip area by using a smaller lookup table. We show that the latency of the proposed divider is 49.4 times the latency of a full-adder. The proposed divider reduces chip area by about 81% than the pipelined divider in [9] which is based on modified Taylor-series.

Voluntary Control of Multisaccade Gaze Shifts During Movement Preparation and Execution

Ramakrishnan A, Chokhandre S, Murthy A. Voluntary control of multisaccade gaze shifts during movement preparation and execution. J Neurophysiol 103: 2400-2416, 2010. First published February 17, 2010; doi: 10.1152/jn.00843.2009. Although the nature of gaze control regulating single saccades is relatively well documented, how such control is implemented to regulate multisaccade gaze shifts is not known. We used highly eccentric targets to elicit multisaccade gaze shifts and tested the ability of subjects to control the saccade sequence by presenting a second target on random trials. Their response allowed us to test the nature of control at many levels: before, during, and between saccades. Although the saccade sequence could be inhibited before it began, we observed clear signs of truncation of the first saccade, which confirmed that it could be inhibited in midflight as well. Using a race model that explains the control of single saccades, we estimated that it took about 100 ms to inhibit a planned saccade but took about 150 ms to inhibit a saccade during its execution. Although the time taken to inhibit was different, the high subject-wise correlation suggests a unitary inhibitory control acting at different levels in the oculomotor system. We also frequently observed responses that consisted of hypometric initial saccades, followed by secondary saccades to the initial target. Given the estimates of the inhibitory process provided by the model that also took into account the variances of the processes as well, the secondary saccades (average latency similar to 215 ms) should have been inhibited. Failure to inhibit the secondary saccade suggests that the intersaccadic interval in a multisaccade response is a ballistic stage. Collectively, these data indicate that the oculomotor system can control a response until a very late stage in its execution. However, if the response consists of multiple movements then the preparation of the second movement becomes refractory to new visual input, either because it is part of a preprogrammed sequence or as a consequence of being a corrective response to a motor error.

Effect of colostrum feeding method and presence of dam on the sleep, rest and sucking behaviour of newborn calves

"In rats, sucking milk reduces anxiety and promotes non-rapid eye movement (NREM) sleep, and in calves it induces resting but the effect on sleep is unknown. Here, we investigated how calves' sleep was affected by colostrum feeding methods. Forty-one calves were blocked by birth date and randomly allotted within blocks to the experimental treatments. Calves were housed for four days either with their dam (DAM) or individually with warm colostrum feeding (2 L four times a day) from either a teat bucket (TEAT) or an open bucket (BUCKET). DAM calves suckled their dam freely. Calves' sleeping and sucking behaviour was filmed continuously for 48 h at the ages of two and three days. Behavioural sleep (BS) was defined as calves resting at least 30 s with their head still and raised (non-rapid eye movement) or with their head against their body or the ground (rapid eye movement, REM). Latency from the end of colostrum feeding to the start of BS was recorded. We compared behaviour of TEAT calves with that of DAM and BUCKET calves using mixed models. Milk meal duration was significantly longer for TEAT calves than for BUCKET calves (mean +/- S.E.M.; 8.3 +/- 0.6 min vs. 5.2 +/- 0.6 min), but equal to that of DAM calves. We found no effect of feeding method on the duration of daily BS (12 h 59 min I h 38 min) but we found a tendency for the daily amount of NREM sleep; BUCKET calves had less NREM sleep per day than TEAT calves (6 h 18 min vs. 7 h 48 min, S.E.M. = 45 min) and also longer latencies from milk ingestion to BS (21.9 +/- 2.0 min vs. 16.2 +/- 2.0 min). DAM calves slept longer bouts than TEAT calves (10.8 +/- 1.0 min vs. 8.3 +/- 1.0 min) and less often (78 +/- 4 vs. 92 +/- 4). Sucking colostrum from a teat bucket compared with drinking from an open"

A Parallel Progressive Refinement Image Rendering Algorithm on a Scalable Multithreaded VLSI Processor Array

In this paper we develop a multithreaded VLSI processor linear array architecture to render complex environments based on the radiosity approach. The processing elements are identical and multithreaded. They work in Single Program Multiple Data (SPMD) mode. A new algorithm to do the radiosity computations based on the progressive refinement approach[2] is proposed. Simulation results indicate that the architecture is latency tolerant and scalable. It is shown that a linear array of 128 uni-threaded processing elements sustains a throughput close to 0.4 million patches/sec.

Analyzing Cache Performance Bottlenecks of STM Applications and addressing them with Compiler's help

Software transactional memory (STM) is a promising programming paradigm for shared memory multithreaded programs as an alternative to traditional lock based synchronization. However adoption of STM in mainstream software has been quite low due to its considerable overheads and its poor cache/memory performance. In this paper, we perform a detailed study of the cache behavior of STM applications and quantify the impact of different STM factors on the cache misses experienced by the applications. Based on our analysis, we propose a compiler driven Lock-Data Colocation (LDC), targeted at reducing the cache overheads on STM. We show that LDC is effective in improving the cache behavior of STM applications by reducing the dcache miss latency and improving execution time performance.

Area Optimized H.264 Intra Prediction Architecture for 1080p HD Resolution

High performance video standards use prediction techniques to achieve high picture quality at low bit rates. The type of prediction decides the bit rates and the image quality. Intra Prediction achieves high video quality with significant reduction in bit rate. This paper present an area optimized architecture for Intra prediction, for H.264 decoding at HDTV resolution with a target of achieving 60 fps. The architecture was validated on Virtex-5 FPGA based platform. The architecture achieves a frame rate of 64 fps. The architecture is based on multi-level memory hierarchy to reduce latency and ensure optimum resources utilization. It removes redundancy by reusing same functional blocks across different modes. The proposed architecture uses only 13% of the total LUTs available on the Xilinx FPGA XC5VLX50T.

Toward Effective Scalar Hardware for Highly Vectorizable Applications

The performance of a program will ultimately be limited by its serial (scalar) portion, as pointed out by Amdahl′s Law. Reported studies thus far of instruction-level parallelism have mixed data-parallel program portions with scalar program portions, often leading to contradictory and controversial results. We report an instruction-level behavioral characterization of scalar code containing minimal data-parallelism, extracted from highly vectorized programs of the PERFECT benchmark suite running on a Cray Y-MP system. We classify scalar basic blocks according to their instruction mix, characterize the data dependencies seen in each class, and, as a first step, measure the maximum intrablock instruction-level parallelism available. We observe skewed rather than balanced instruction distributions in scalar code and in individual basic block classes of scalar code; nonuniform distribution of parallelism across instruction classes; and, as expected, limited available intrablock parallelism. We identify frequently occurring data-dependence patterns and discuss new instructions to reduce latency. Toward effective scalar hardware, we study latency-pipelining trade-offs and restricted multiple instruction issue mechanisms.

Design issues and caching strategies for CD-ROM based multimedia storage

CD-ROMs have proliferated as a distribution media for desktop machines for a large variety of multimedia applications (targeted for a single-user environment) like encyclopedias, magazines and games. With CD-ROM capacities up to 3 GB being available in the near future, they will form an integral part of Video on Demand (VoD) servers to store full-length movies and multimedia. In the first section of this paper we look at issues related to the single- user desktop environment. Since these multimedia applications are highly interactive in nature, we take a pragmatic approach, and have made a detailed study of the multimedia application behavior in terms of the I/O request patterns generated to the CD-ROM subsystem by tracing these patterns. We discuss prefetch buffer design and seek time characteristics in the context of the analysis of these traces. We also propose an adaptive main-memory hosted cache that receives caching hints from the application to reduce the latency when the user moves from one node of the hyper graph to another. In the second section we look at the use of CD-ROM in a VoD server and discuss the problem of scheduling multiple request streams and buffer management in this scenario. We adapt the C-SCAN (Circular SCAN) algorithm to suit the CD-ROM drive characteristics and prove that it is optimal in terms of buffer size management. We provide computationally inexpensive relations by which this algorithm can be implemented. We then propose an admission control algorithm which admits new request streams without disrupting the continuity of playback of the previous request streams. The algorithm also supports operations such as fast forward and replay. Finally, we discuss the problem of optimal placement of MPEG streams on CD-ROMs in the third section.

Single-Generation Network Coding for Networks with Delay

A single-source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the incoming symbols (received at their incoming edges) on their outgoing edges. Memory-free networks with delay using network coding are forced to do inter-generation network coding, as a result of which the problem of some or all sinks requiring a large amount of memory for decoding is faced. In this work, we address this problem by utilizing memory elements at the internal nodes of the network also, which results in the reduction of the number of memory elements used at the sinks. We give an algorithm which employs memory at all the nodes of the network to achieve single- generation network coding. For fixed latency, our algorithm reduces the total number of memory elements used in the network to achieve single- generation network coding. We also discuss the advantages of employing single-generation network coding together with convolutional network-error correction codes (CNECCs) for networks with unit- delay and illustrate the performance gain of CNECCs by using memory at the intermediate nodes using simulations on an example network under a probabilistic network error model.