Small Ubiquitin-related Modifier Ligase Activity of Mms21 Is Required for Maintenance of Chromosome Integrity during the Unperturbed Mitotic Cell Division Cycle in Saccharomyces cerevisiae

The SUMO ligase activity of Mms21/Nse2, a conserved member of the Smc5/6 complex, is required for resisting extrinsically induced genotoxic stress. We report that the Mms21 SUMO ligase activity is also required during the unchallenged mitotic cell cycle in Saccharomyces cerevisiae. SUMO ligase-defective cells were slow growing and spontaneously incurred DNA damage. These cells required caffeine-sensitive Mec1 kinase-dependent checkpoint signaling for survival even in the absence of extrinsically induced genotoxic stress. SUMO ligase-defective cells were sensitive to replication stress and displayed synthetic growth defects with DNA damage checkpoint-defective mutants such as mec1, rad9, and rad24. MMS21 SUMO ligase and mediator of replication checkpoint 1 gene (MRC1) were epistatic with respect to hydroxyurea-induced replication stress or methyl methanesulfonate-induced DNA damage sensitivity. Subjecting Mms21 SUMO ligase-deficient cells to transient replication stress resulted in enhancement of cell cycle progression defects such as mitotic delay and accumulation of hyperploid cells. Consistent with the spontaneous activation of the DNA damage checkpoint pathway observed in the Mms21-mediated sumoylation-deficient cells, enhanced frequency of chromosome breakage and loss was detected in these mutant cells. A mutation in the conserved cysteine 221 that is engaged in coordination of the zinc ion in Loop 2 of the Mms21 SPL-RING E3 ligase catalytic domain resulted in strong replication stress sensitivity and also conferred slow growth and Mec1 dependence to unchallenged mitotically dividing cells. Our findings establish Mms21-mediated sumoylation as a determinant of cell cycle progression and maintenance of chromosome integrity during the unperturbed mitotic cell division cycle in budding yeast.

Incentive compatible mechanisms for group ticket allocation in software maintenance services

A customer reported problem (or Trouble Ticket) in software maintenance is typically solved by one or more maintenance engineers. The decision of allocating the ticket to one or more engineers is generally taken by the lead, based on customer delivery deadlines and a guided complexity assessment from each maintenance engineer. The key challenge in such a scenario is two folds, un-truthful (hiked up) elicitation of ticket complexity by each engineer to the lead and the decision of allocating the ticket to a group of engineers who will solve the ticket with in customer deadline. The decision of allocation should ensure Individual and Coalitional Rationality along with Coalitional Stability. In this paper we use game theory to examine the issue of truthful elicitation of ticket complexities by engineers for solving ticket as a group given a specific customer delivery deadline. We formulate this problem as strategic form game and propose two mechanisms, (1) Division of Labor (DOL) and (2) Extended Second Price (ESP). In the proposed mechanisms we show that truth telling by each engineer constitutes a Dominant Strategy Nash Equilibrium of the underlying game. Also we analyze the existence of Individual Rationality (IR) and Coalitional Rationality (CR) properties to motivate voluntary and group participation. We use Core, solution concept from co-operative game theory to analyze the stability of the proposed group based on the allocation and payments.

Operational experience on a grid connected 100 kWe biomass gasification power plant in Karnataka, India

The paper reports the operational experience from a 100 kWe gasification power plant connected to the grid in Karnataka. Biomass Energy for Rural India (BERI) is a program that implemented gasification based power generation with an installed capacity of 0.88 MWe distributed over three locations to meet the electrical energy needs in the district of Tumkur. The operation of one 100 kWe power plant was found unsatisfactory and not meeting the designed performance. The Indian Institute of Science, Bangalore, the technology developer, took the initiative to ensure the system operation, capacity building and prove the designed performance. The power plant connected to the grid consists of the IISc gasification system which includes reactor, cooling, cleaning system, fuel drier and water treatment system to meet the producer gas quality for an engine. The producer gas is used as a fuel in Cummins India Limited, GTA 855 G model, turbo charged engine and the power output is connected to the grid. The system has operated for over 1000 continuous hours, with only about 70 h of grid outages. The total biomass consumption for 1035 h of operation was 111 t at an average of 107 kg/h. Total energy generated was 80.6 MWh reducing over loot of CO(2) emissions. The overall specific fuel consumption was about 1.36 kg/kWh, amounting to an overall efficiency from biomass to electricity of about 18%. The present operations indicate that a maintenance schedule for the plant can be at the end of 1000 h. The results for another 1000 h of operation by the local team are also presented. (C) 2011 International Energy Initiative. Published by Elsevier Inc. All rights reserved.

Optimal maintenance policies for machines subject to deterioration and intermittent breakdowns

Optimal preventive maintenance policies, for a machine subject to deterioration with age and intermittent breakdowns and repairs, are derived using optimal control theory. The optimal policies are shown to be of bang-bang nature. The extension to the case when there are a large number of identical machines and several repairmen in the system is considered next. This model takes into account the waiting line formed at the repair facility and establishes a link between this problem and the classical ``repairmen problem.''

Optimal maintenance policy of a machine subject to failure

Optimal maintenance policies for a machine with degradation in performance with age and subject to failure are derived using optimal control theory. The optimal policies are shown to be, normally, of bang-coast nature, except in the case when probability of machine failure is a function of maintenance. It is also shown, in the deterministic case that a higher depreciation rate tends to reverse this policy to coast-bang. When the probability of failure is a function of maintenance, considerable computational effort is needed to obtain an optimal policy and the resulting policy is not easily implementable. For this case also, an optimal policy in the class of bang-coast policies is derived, using a semi-Markov decision model. A simple procedure for modifying the probability of machine failure with maintenance is employed. The results obtained extend and unify the recent results for this problem along both theoretical and practical lines. Numerical examples are presented to illustrate the results obtained.

Queuing Network Models for Aircraft Availability and Spares Management

Interactions of major activities involved in airfleet operations, maintenance, and logistics are investigated in the framework of closed queuing networks with finite number of customers. The system is viewed at three levels, namely: operations at the flying-base, maintenance at the repair-depot, and logistics for subsystems and their interactions in achieving the system objectives. Several performance measures (eg, availability of aircraft at the flying-base, mean number of aircraft on ground at different stages of repair, use of repair facilities, and mean time an aircraft spends in various stages of repair) can easily be computed in this framework. At the subsystem level the quantities of interest are the unavailability (probability of stockout) of a spare and the duration of its unavailability. The repair-depot capability is affected by the unavailability of a spare which in turn, adversely affects the availability of aircraft at the flying-base level. Examples illustrate the utility of the proposed models.

Queen signal should be honest to be involved in maintenance of eusociality: chemical correlates of fertility in Ropalidia marginata

Queens of many social insect species are known to maintain reproductive monopoly by pheromonal signalling of fecundity. Queens of the primitively eusocial wasp Ropalidia marginata appear to do so using secretions from their Dufour's glands, whose hydrocarbon composition is correlated with fertility. Solitary nest foundresses of R. marginata are without nestmates; hence expressing a queen signal can be redundant, since there is no one to receive the signal. But if queen pheromone is an honest signal inextricably linked with fertility, it should correlate with fertility and be expressed irrespective of the presence or absence of receivers of the signal, by virtue of being a byproduct of the state of fertility. Hence we compared the Dufour's gland hydrocarbons and ovaries of solitary foundresses with queens and workers of post-emergence nests. Our results suggest that queen pheromone composition in R. marginata is a byproduct of fertility and hence can honestly signal fertility. This provides important new evidence for the honest signalling hypothesis.

Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance

We present two online algorithms for maintaining a topological order of a directed n-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles m arc additions in O(m(3/2)) time. For sparse graphs (m/n = O(1)), this bound improves the best previous bound by a logarithmic factor, and is tight to within a constant factor among algorithms satisfying a natural locality property. Our second algorithm handles an arbitrary sequence of arc additions in O(n(5/2)) time. For sufficiently dense graphs, this bound improves the best previous bound by a polynomial factor. Our bound may be far from tight: we show that the algorithm can take Omega(n(2)2 root(2lgn)) time by relating its performance to a generalization of the k-levels problem of combinatorial geometry. A completely different algorithm running in Theta (n(2) log n) time was given recently by Bender, Fineman, and Gilbert. We extend both of our algorithms to the maintenance of strong components, without affecting the asymptotic time bounds.