9 resultados para Restart

em Indian Institute of Science - Bangalore - Índia


Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present a low-complexity algorithm based on reactive tabu search (RTS) for near maximum likelihood (ML) detection in large-MIMO systems. The conventional RTS algorithm achieves near-ML performance for 4-QAM in large-MIMO systems. But its performance for higher-order QAM is far from ML performance. Here, we propose a random-restart RTS (R3TS) algorithm which achieves significantly better bit error rate (BER) performance compared to that of the conventional RTS algorithm in higher-order QAM. The key idea is to run multiple tabu searches, each search starting with a random initial vector and choosing the best among the resulting solution vectors. A criterion to limit the number of searches is also proposed. Computer simulations show that the R3TS algorithm achieves almost the ML performance in 16 x 16 V-BLAST MIMO system with 16-QAM and 64-QAM at significantly less complexities than the sphere decoder. Also, in a 32 x 32 V-BLAST MIMO system, the R3TS performs close to ML lower bound within 1.6 dB for 16-QAM (128 bps/Hz), and within 2.4 dB for 64-QAM (192 bps/Hz) at 10(-3) BER.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Aberrant DNA replication, defects in the protection, and restart of stalled replication forks are major causes of genome instability in all organisms. Replication fork reversal is emerging as an evolutionarily conserved physiological response for restart of stalled forks. Escherichia coli RecG, RuvAB, and RecA proteins have been shown to reverse the model replication fork structures in vitro. However, the pathways and the mechanisms by which Mycobacterium tuberculosis, a slow growing human pathogen, responds to different types of replication stress and DNA damage are unclear. Here, we show that M. tuberculosis RecG rescues E. coli Delta recG cells from replicative stress. The purified M. tuberculosis RecG (MtRecG) and RuvAB(MtRuvAB) proteins catalyze fork reversal of model replication fork structures with and without a leading strand single-stranded DNA gap. Interestingly, single-stranded DNA-binding protein suppresses the MtRecG- and MtRuvAB-mediated fork reversal with substrates that contain lagging strand gap. Notably, our comparative studies with fork structures containing template damage and template switching mechanism of lesion bypass reveal that MtRecG but not MtRuvAB or MtRecA is proficient in driving the fork reversal. Finally, unlike MtRuvAB, we find that MtRecG drives efficient reversal of forks when fork structures are tightly bound by protein. These results provide direct evidence and valuable insights into the underlying mechanism of MtRecG-catalyzed replication fork remodeling and restart pathways in vivo.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mammalian RAD51 paralogs are implicated in the repair of collapsed replication forks by homologous recombination. However, their physiological roles in replication fork maintenance prior to fork collapse remain obscure. Here, we report on the role of RAD51 paralogs in short-term replicative stress devoid of DSBs. We show that RAD51 paralogs localize to nascent DNA and common fragile sites upon replication fork stalling. Strikingly, RAD51 paralogs deficient cells exhibit elevated levels of 53BP1 nuclear bodies and increased DSB formation, the latter being attributed to extensive degradation of nascent DNA at stalled forks. RAD51C and XRCC3 promote the restart of stalled replication in an ATP hydrolysis dependent manner by disengaging RAD51 and other RAD51 paralogs from the halted forks. Notably, we find that Fanconi anemia (FA)-like disorder and breast and ovarian cancer patient derived mutations of RAD51C fails to protect replication fork, exhibit under-replicated genomic regions and elevated micro-nucleation. Taken together, RAD51 paralogs prevent degradation of stalled forks and promote the restart of halted replication to avoid replication fork collapse, thereby maintaining genomic integrity and suppressing tumorigenesis.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Computational grids with multiple batch systems (batch grids) can be powerful infrastructures for executing long-running multicomponent parallel applications. In this paper, we have constructed a middleware framework for executing such long-running applications spanning multiple submissions to the queues on multiple batch systems. We have used our framework for execution of a foremost long-running multi-component application for climate modeling, the Community Climate System Model (CCSM). Our framework coordinates the distribution, execution, migration and restart of the components of CCSM on the multiple queues where the component jobs of the different queues can have different queue waiting and startup times.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The RAD51 paralogs XRCC3 and RAD51C have been implicated in homologous recombination (HR) and DNA damage responses. However, the molecular mechanism(s) by which these paralogs regulate HR and DNA damage signaling remains obscure. Here, we show that an SQ motif serine 225 in XRCC3 is phosphorylated by ATR kinase in an ATM signaling pathway. We find that RAD51C but not XRCC2 is essential for XRCC3 phosphorylation, and this modification follows end resection and is specific to S and G(2) phases. XRCC3 phosphorylation is required for chromatin loading of RAD51 and HR-mediated repair of double-strand breaks (DSBs). Notably, in response to DSBs, XRCC3 participates in the intra-S-phase checkpoint following its phosphorylation and in the G(2)/M checkpoint independently of its phosphorylation. Strikingly, we find that XRCC3 distinctly regulates recovery of stalled and collapsed replication forks such that phosphorylation is required for the HR-mediated recovery of collapsed replication forks but is dispensable for the restart of stalled replication forks. Together, these findings suggest that XRCC3 is a new player in the ATM/ATR-induced DNA damage responses to control checkpoint and HR-mediated repair.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper, we propose low-complexity algorithms based on Monte Carlo sampling for signal detection and channel estimation on the uplink in large-scale multiuser multiple-input-multiple-output (MIMO) systems with tens to hundreds of antennas at the base station (BS) and a similar number of uplink users. A BS receiver that employs a novel mixed sampling technique (which makes a probabilistic choice between Gibbs sampling and random uniform sampling in each coordinate update) for detection and a Gibbs-sampling-based method for channel estimation is proposed. The algorithm proposed for detection alleviates the stalling problem encountered at high signal-to-noise ratios (SNRs) in conventional Gibbs-sampling-based detection and achieves near-optimal performance in large systems with M-ary quadrature amplitude modulation (M-QAM). A novel ingredient in the detection algorithm that is responsible for achieving near-optimal performance at low complexity is the joint use of a mixed Gibbs sampling (MGS) strategy coupled with a multiple restart (MR) strategy with an efficient restart criterion. Near-optimal detection performance is demonstrated for a large number of BS antennas and users (e. g., 64 and 128 BS antennas and users). The proposed Gibbs-sampling-based channel estimation algorithm refines an initial estimate of the channel obtained during the pilot phase through iterations with the proposed MGS-based detection during the data phase. In time-division duplex systems where channel reciprocity holds, these channel estimates can be used for multiuser MIMO precoding on the downlink. The proposed receiver is shown to achieve good performance and scale well for large dimensions.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper, we propose a low-complexity algorithm based on Markov chain Monte Carlo (MCMC) technique for signal detection on the uplink in large scale multiuser multiple input multiple output (MIMO) systems with tens to hundreds of antennas at the base station (BS) and similar number of uplink users. The algorithm employs a randomized sampling method (which makes a probabilistic choice between Gibbs sampling and random sampling in each iteration) for detection. The proposed algorithm alleviates the stalling problem encountered at high SNRs in conventional MCMC algorithm and achieves near-optimal performance in large systems with M-QAM. A novel ingredient in the algorithm that is responsible for achieving near-optimal performance at low complexities is the joint use of a randomized MCMC (R-MCMC) strategy coupled with a multiple restart strategy with an efficient restart criterion. Near-optimal detection performance is demonstrated for large number of BS antennas and users (e.g., 64, 128, 256 BS antennas/users).

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Specification of the centromere location in most eukaryotes is not solely dependent on the DNA sequence. However, the non-genetic determinants of centromere identity are not clearly defined. While multiple mechanisms, individually or in concert, may specify centromeres epigenetically, most studies in this area are focused on a universal factor, a centromere-specific histone H3 variant CENP-A, often considered as the epigenetic determinant of centromere identity. In spite of variable timing of its loading at centromeres across species, a replication coupled early S phase deposition of CENP-A is found in most yeast centromeres. Centromeres are the earliest replicating chromosomal regions in a pathogenic budding yeast Candida albicans. Using a 2-dimensional agarose gel electrophoresis assay, we identify replication origins (ORI7-LI and ORI7-RI) proximal to an early replicating centromere (CEN7) in C. albicans. We show that the replication forks stall at CEN7 in a kinetochore dependent manner and fork stalling is reduced in the absence of the homologous recombination (HR) proteins Rad51 and Rad52. Deletion of ORI7-RI causes a significant reduction in the stalled fork signal and an increased loss rate of the altered chromosome 7. The HR proteins, Rad51 and Rad52, have been shown to play a role in fork restart. Confocal microscopy shows declustered kinetochores in rad51 and rad52 mutants, which are evidence of kinetochore disintegrity. CENP-A(CaCse4) levels at centromeres, as determined by chromatin immunoprecipitation (ChIP) experiments, are reduced in absence of Rad51/Rad52 resulting in disruption of the kinetochore structure. Moreover, western blot analysis reveals that delocalized CENP-A molecules in HR mutants degrade in a similar fashion as in other kinetochore mutants described before. Finally, co-immunoprecipitation assays indicate that Rad51 and Rad52 physically interact with CENP-A(CaCse4) in vivo. Thus, the HR proteins Rad51 and Rad52 epigenetically maintain centromere functioning by regulating CENP-A(CaCse4) levels at the programmed stall sites of early replicating centromeres.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The growing number of applications and processing units in modern Multiprocessor Systems-on-Chips (MPSoCs) come along with reduced time to market. Different IP cores can come from different vendors, and their trust levels are also different, but typically they use Network-on-Chip (NoC) as their communication infrastructure. An MPSoC can have multiple Trusted Execution Environments (TEEs). Apart from performance, power, and area research in the field of MPSoC, robust and secure system design is also gaining importance in the research community. To build a secure system, the designer must know beforehand all kinds of attack possibilities for the respective system (MPSoC). In this paper we survey the possible attack scenarios on present-day MPSoCs and investigate a new attack scenario, i.e., router attack targeted toward NoC architecture. We show the validity of this attack by analyzing different present-day NoC architectures and show that they are all vulnerable to this type of attack. By launching a router attack, an attacker can control the whole chip very easily, which makes it a very serious issue. Both routing tables and routing logic-based routers are vulnerable to such attacks. In this paper, we address attacks on routing tables. We propose different monitoring-based countermeasures against routing table-based router attack in an MPSoC having multiple TEEs. Synthesis results show that proposed countermeasures, viz. Runtime-monitor, Restart-monitor, Intermediate manager, and Auditor, occupy areas that are 26.6, 22, 0.2, and 12.2 % of a routing table-based router area. Apart from these, we propose Ejection address checker and Local monitoring module inside a router that cause 3.4 and 10.6 % increase of a router area, respectively. Simulation results are also given, which shows effectiveness of proposed monitoring-based countermeasures.