A novel repair model for imperfect maintenance

Commonly used repair rate models for repairable systems in the reliability literature are renewal processes, generalised renewal processes or non-homogeneous Poisson processes. In addition to these models, geometric processes (GP) are studied occasionally. The GP, however, can only model systems with monotonously changing (increasing, decreasing or constant) failure intensities. This paper deals with the reliability modelling of failure processes for repairable systems where the failure intensity shows a bathtub-type non-monotonic behaviour. A new stochastic process, i.e. an extended Poisson process, is introduced in this paper. Reliability indices are presented, and the parameters of the new process are estimated. Experimental results on a data set demonstrate the validity of the new process.

Modelling: promoting creativity whilst forging links between science education and design and technology education

Educational reforms in many countries currently call for the development of knowledge-based societies. In particular, emphasis is placed on the promotion of creativity, especially in the areas of science education and of design and technology education. In this paper, perceptions of the nature of creativity and of the conditions for its realization are discussed. The notion of modelling as a creative act is outlined and the scope for using modelling as a bridge between science education and design and technology education explored. A model for the creative act of modelling is proposed and its major aspects elaborated upon. Finally, strategies for forging links between the two subjects are outlined.

Depression, confidence, and decision: evidence against depressive realism

This research examined how retrospective self-assessments of performance are affected by major depression. To test the validity of the depressive realism versus the selective processing hypotheses, aggregate posttest performance estimates (PTPEs) were obtained from clinically depressed patients and an age-matched comparison group across 4 decision tasks (object recognition, general knowledge, social judgment, and line-length judgment). As expected on the basis of previous findings, both groups were underconfident in their PTPEs, consistently underestimating the percentage of questions they had answered correctly. Contrary to depressive realism, and in partial support of the selective processing account, this underconfidence effect was not reduced but modestly exacerbated in the depressed patients. Further, whereas the PTPEs of the comparison group exceeded that expected on the basis of chance alone those of the depressed individuals did not. The results provide no support for the depressive realism account and suggest that negative biases contribute to metacognitive information processing in major depression.

Input constraints handling in an MPC/feedback linearization scheme

The combination of model predictive control based on linear models (MPC) with feedback linearization (FL) has attracted interest for a number of years, giving rise to MPC+FL control schemes. An important advantage of such schemes is that feedback linearizable plants can be controlled with a linear predictive controller with a fixed model. Handling input constraints within such schemes is difficult since simple bound contraints on the input become state dependent because of the nonlinear transformation introduced by feedback linearization. This paper introduces a technique for handling input constraints within a real time MPC/FL scheme, where the plant model employed is a class of dynamic neural networks. The technique is based on a simple affine transformation of the feasible area. A simulated case study is presented to illustrate the use and benefits of the technique.

The locally twisted cubes

This paper introduces a new variant of the popular n-dimensional hypercube network Q(n), known as the n-dimensional locally twisted cube LTQ(n), which has the same number of nodes and the same number of connections per node as Q(n). Furthermore. LTQ(n) is similar to Q(n) in the sense that the nodes can be one-to-one labeled with 0-1 binary sequences of length n. so that the labels of any two adjacent nodes differ in at most two successive bits. One advantage of LTQ(n) is that the diameter is only about half of the diameter of Q(n) We develop a simple routing algorithm for LTQ(n), which creates a shortest path from the source to the destination in O(n) time. We find that LTQ(n) consists of two disjoint copies of Q(n) by adding a matching between their nodes. On this basis. we show that LTQ(n) has a connectivity of n.

Mathematical modelling for the digital society

We argue the case for a new branch of mathematics and its applications: Mathematics for the Digital Society. There is a challenge for mathematics, a strong “pull” from new and emerging commercial and public activities; and a need to train and inspire a generation of quantitative scientists who will seek careers within the associated sectors. Although now going through an early phase of boiling up, prior to scholarly distillation, we discuss how data rich activities and applications may benefit from a wide range of continuous and discrete models, methods, analysis and inference. In ten years time such applications will be common place and associated courses may be embedded within the undergraduate curriculum.

Models for evolving networks: with applications in telecommunication and online activities

Driven by a range of modern applications that includes telecommunications, e-business and on-line social interaction, recent ideas in complex networks can be extended to the case of time-varying connectivity. Here we propose a general frame- work for modelling and simulating such dynamic networks, and we explain how the long time behaviour may reveal important information about the mechanisms underlying the evolution.