82 resultados para Maintenance strategies
Resumo:
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.
Resumo:
Development of new multifunctional nanostructures relies on the ability to make new materials at the nanoscale with control over size, shape and composition. While this control is extremely important to tune several properties, an alternative strategy is to create active interfaces between two or more nanostructures to form nanoscale heterostructures. In these heterostructures, the interfaces play a key role in stabilizing and enhancing the efficiency of the individual components for various applications. In this article, we discuss synthesis methods of different types of nanoscale heterostructures and the role of interfaces in various applications. We present the current state-of-the-art in designing heterostructures and possible upcoming synthetic strategies with their advantages and disadvantages. We present how such heterostructures are highly efficient for catalytic, photovoltaic and nanoelectronic applications drawing several examples from our own studies and from the literature.
Resumo:
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.''
Resumo:
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.
Resumo:
When an Indian prime minister publicly admits that India has fallen behind China, it is news. Manmohan Singh's statement last January at the Indian Science Congress in Bhubaneswar that this is so with respect to scientific research, and that “India's relative position in the world of science has been declining”, has rung alarm bells. Singh was not springing anything new on Indian scientists; many of us will admit that things are not well1. Recognizing the problem is the first step towards reversing this slide.
Resumo:
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.
Resumo:
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.
Resumo:
Comparison of multiple protein structures has a broad range of applications in the analysis of protein structure, function and evolution. Multiple structure alignment tools (MSTAs) are necessary to obtain a simultaneous comparison of a family of related folds. In this study, we have developed a method for multiple structure comparison largely based on sequence alignment techniques. A widely used Structural Alphabet named Protein Blocks (PBs) was used to transform the information on 3D protein backbone conformation as a ID sequence string. A progressive alignment strategy similar to CLUSTALW was adopted for multiple PB sequence alignment (mulPBA). Highly similar stretches identified by the pairwise alignments are given higher weights during the alignment. The residue equivalences from PB based alignments are used to obtain a three dimensional fit of the structures followed by an iterative refinement of the structural superposition. Systematic comparisons using benchmark datasets of MSTAs underlines that the alignment quality is better than MULTIPROT, MUSTANG and the alignments in HOMSTRAD, in more than 85% of the cases. Comparison with other rigid-body and flexible MSTAs also indicate that mulPBA alignments are superior to most of the rigid-body MSTAs and highly comparable to the flexible alignment methods. (C) 2012 Elsevier Masson SAS. All rights reserved.
Resumo:
Carbon footprint (CF) refers to the total amount of carbon dioxide and its equivalents emitted due to various anthropogenic activities. Carbon emission and sequestration inventories have been reviewed sector-wise for all federal states in India to identify the sectors and regions responsible for carbon imbalances. This would help in implementing appropriate climate change mitigation and management strategies at disaggregated levels. Major sectors of carbon emissions in India are through electricity generation, transport, domestic energy consumption, industries and agriculture. A majority of carbon storage occurs in forest biomass and soil. This paper focuses on the statewise carbon emissions (CO2. CO and CH4), using region specific emission factors and statewise carbon sequestration capacity. The estimate shows that CO2, CO and CH4 emissions from India are 965.9, 22.5 and 16.9 Tg per year, respectively. Electricity generation contributes 35.5% of total CO2 emission, which is followed by the contribution from transport. Vehicular transport exclusively contributes 25.5% of total emission. The analysis shows that Maharashtra emits higher CO2, followed by Andhra Pradesh, Uttar Pradesh, Gujarat, Tamil Nadu and West Bengal. The carbon status, which is the ratio of annual carbon storage against carbon emission, for each federal state is computed. This shows that small states and union territories (UT) like Arunachal Pradesh, Mizoram and Andaman and Nicobar Islands, where carbon sequestration is higher due to good vegetation cover, have carbon status > 1. Annually, 7.35% of total carbon emissions get stored either in forest biomass or soil, out of which 34% is in Arunachal Pradesh, Madhya Pradesh, Chhattisgarh and Orissa. (C) 2012 Elsevier Ltd. All rights reserved.