Burn-in policies for products having dormant states

Many systems might have a long time dormant period, during which the systems are not operated. For example, most building services products are installed while a building is constructed, but they are not operated until the building is commissioned. Warranty terms for such products may cover the time starting from their installation times to the end of their warranty periods. Prior to the commissioning of the building, the building services products are protected by warranty although they are not operating. Developing optimal burn-in policies for such products is important when warranty cost is analysed. This paper considers two burn-in policies, which incur different burn-in costs, and have different burn-in effects on the products. A special case about the relationship between the failure rates of the products at the dormant state and at the operating state is presented. Numerical examples compare the mean total warranty costs of these two burn-in policies.

Burn in policies for products having dormant states

Constructing a building is a long process which can take several years. Most building services products are installed while a building is constructed, but they are not operated until the building is commissioned. The warranty term for the building service systems may cover the time starting from their installation to the end of the warranty period. Prior to the commissioning of the building, the building services systems are protected by warranty although they are not operated. The bum in time for such systems is important when warranty costs is analyzed. In this paper, warranty cost models for products with burn in periods are presented. Two burn in policies are developed to optimize the total mean warranty cost. A special case on the relationship between the failure rates of the product at the dormant state and at the I operating state is presented.

Optimal maintenance policies under different operational schedules

In the reliability literature, maintenance time is usually ignored during the optimization of maintenance policies. In some scenarios, costs due to system failures may vary with time, and the ignorance of maintenance time will lead to unrealistic results. This paper develops maintenance policies for such situations where the system under study operates iteratively at two successive states: up or down. The costs due to system failure at the up state consist of both business losses & maintenance costs, whereas those at the down state only include maintenance costs. We consider three models: Model A, B, and C: Model A makes only corrective maintenance (CM). Model B performs imperfect preventive maintenance (PM) sequentially, and CM. Model C executes PM periodically, and CM; this PM can restore the system as good as the state just after the latest CM. The CM in this paper is imperfect repair. Finally, the impact of these maintenance policies is illustrated through numerical examples.

Perspex machine VII: The universal perspex machine

The perspex machine arose from the unification of projective geometry with the Turing machine. It uses a total arithmetic, called transreal arithmetic, that contains real arithmetic and allows division by zero. Transreal arithmetic is redefined here. The new arithmetic has both a positive and a negative infinity which lie at the extremes of the number line, and a number nullity that lies off the number line. We prove that nullity, 0/0, is a number. Hence a number may have one of four signs: negative, zero, positive, or nullity. It is, therefore, impossible to encode the sign of a number in one bit, as floating-, point arithmetic attempts to do, resulting in the difficulty of having both positive and negative zeros and NaNs. Transrational arithmetic is consistent with Cantor arithmetic. In an extension to real arithmetic, the product of zero, an infinity, or nullity with its reciprocal is nullity, not unity. This avoids the usual contradictions that follow from allowing division by zero. Transreal arithmetic has a fixed algebraic structure and does not admit options as IEEE, floating-point arithmetic does. Most significantly, nullity has a simple semantics that is related to zero. Zero means "no value" and nullity means "no information." We argue that nullity is as useful to a manufactured computer as zero is to a human computer. The perspex machine is intended to offer one solution to the mind-body problem by showing how the computable aspects of mind and. perhaps, the whole of mind relates to the geometrical aspects of body and, perhaps, the whole of body. We review some of Turing's writings and show that he held the view that his machine has spatial properties. In particular, that it has the property of being a 7D lattice of compact spaces. Thus, we read Turing as believing that his machine relates computation to geometrical bodies. We simplify the perspex machine by substituting an augmented Euclidean geometry for projective geometry. This leads to a general-linear perspex-machine which is very much easier to pro-ram than the original perspex-machine. We then show how to map the whole of perspex space into a unit cube. This allows us to construct a fractal of perspex machines with the cardinality of a real-numbered line or space. This fractal is the universal perspex machine. It can solve, in unit time, the halting problem for itself and for all perspex machines instantiated in real-numbered space, including all Turing machines. We cite an experiment that has been proposed to test the physical reality of the perspex machine's model of time, but we make no claim that the physical universe works this way or that it has the cardinality of the perspex machine. We leave it that the perspex machine provides an upper bound on the computational properties of physical things, including manufactured computers and biological organisms, that have a cardinality no greater than the real-number line.

A universal primer for isolation of fragments of a gene encoding phytoene desaturase for use in virus-induced gene silencing (VIGS) studies

We have been using Virus-Induced Gene Silencing (VIGS) to test the function of genes that are candidates for involvement in floral senescence. Although VIGS is a powerful tool for assaying the effects of gene silencing in plants, relatively few taxa have been studied using this approach, and most that have are in the Solanaceae. We typically use silencing of phytoene desaturase (PDS) in preliminary tests of the feasibility of using VIGS. Silencing this gene, whose product is involved in carotene biosynthesis, results in a characteristic photobleaching phenotype in the leaves. We have found that efficient silencing requires the use of fragments that are more than 90% homologous to the target gene. To simplify testing the effectiveness of VIGS in a range of species, we designed a set of universal primers to a region of the PDS gene that is highly conserved among species, and that therefore allows an investigator to isolate a fragment of the homologous PDS gene from the species of interest. We report the sequences of these primers and the results of VIGS experiments in horticultural species from the Asteraceae, Leguminosae, Balsaminaceae and Solanaceae.