Analyzing clusters of class characteristics in OO applications

The transition from Java 1.4 to Java 1.5 has provided the programmer with more flexibility due to the inclusion of several new language constructs, such as parameterized types. This transition is expected to increase the number of class clusters exhibiting different combinations of class characteristics. In this paper we investigate how the number and distribution of clusters are expected to change during this transition. We present the results of an empirical study were we analyzed applications written in both Java 1.4 and 1.5. In addition, we show how the variability of the combinations of class characteristics may affect the testing of class members.     

Distributing test cases more evenly in adaptive random testing

Adaptive random testing (ART) has recently been proposed to enhance the failure-detection capability of random testing. In ART, test cases are not only randomly generated, but also evenly spread over the input domain. Various ART algorithms have been developed to evenly spread test cases in different ways. Previous studies have shown that some ART algorithms prefer to select test cases from the edge part of the input domain rather than from the centre part, that is, inputs do not have equal chance to be selected as test cases. Since we do not know where the failure-causing inputs are prior to testing, it is not desirable for inputs to have different chances of being selected as test cases. Therefore, in this paper, we investigate how to enhance some ART algorithms by offsetting the edge preference, and propose a new family of ART algorithms. A series of simulations have been conducted and it is shown that these new algorithms not only select test cases more evenly, but also have better failure detection capabilities.     

Dynamic programming for impulse controls

This paper describes the theory of feedback control in the class of inputs which allow delta-functions and their derivatives. It indicates a modification of dynamic programming techniques appropriate for such problems. Introduced are physically realizable bang-bang-type approximations of the “ideal” impulse-type solutions. These may also serve as “fast” feedback controls which solve the terminal control problem in arbitrary small time. Examples of damping high-order oscillations in finite time are presented.     

Media Convergence: Creating Content, Questioning Relationships

The development, dissemination, and proliferation of multimedia and media convergent texts raise a number of pressing questions for literacy scholars in general and compositionists in particular. What kinds of literacy practices are students developing through their use and composition of multimodal and new media texts? What genres are used in the creation of such texts, and why? Are there particular genres that are favored? How are older genres remediated or recast through media convergence? What research methodology challenges are posed when attempting to study multimodal and new media texts? How might compositionists use media convergence to teach students about academic literacies, about research, about the changing nature of “writing?” What might media convergence look like in the future? Perhaps most immediately, the phrase itself—“media convergence”—begs a question: what, exactly, is converging? This special issue of Computers and Composition on “Media Convergence” poses answers—sometimes tentative, sometimes provocative—to these questions.     

A Pedagogy of Play: Integrating Computer Games into the Writing Classroom

Traditional distinctions between work/play and classroom/gamespace create barriers to computer games’ integration into academic settings and the writing classroom in particular. For a writing class, the work/play distinction often relegates games to an object of analysis in which students critique the games but have little invested in the gameplay itself. After examining briefly how historical changes in education created these distinctions, we offer an alternative position that places play and gamespace within the realm of the classroom. In so doing, we open up a gap for computer game theory to inform the pedagogy that can be practiced in a writing classroom. We show one such example of game theory informing writing pedagogy—the theory of emergent gaming. We then offer an example of an enacted emergent pedagogy in which students play the massively multiplayer online role-playing game World of Warcraft throughout the term, composing self-determined, rhetorically focused writing projects informed by play and written for other game players.     

Delay-dependent robust stability of uncertain fuzzy large-scale systems with time-varying delays

This paper addresses the stability problem of fuzzy large-scale systems (FLSSs) with uncertainties and arbitrary time-varying delays. The stability conditions, which are less conservative and more applicable than the existing results, are derived by a novel Lyapunov-Krasovskii functional method and expressed in terms of linear matrix inequalities (LMIs). Two examples are given to demonstrate the correctness and advantage of our theoretical results.     

Controller certification

A modern problem from aerospace control involves the certification of a large set of potential controllers with either a single plant or a fleet of potential plant systems, with both plants and controllers being MIMO and, for the moment, linear. Experiments on a limited number of controller/plant pairs should establish the stability and a certain level of margin of the complete set. We consider this certification problem for a set of controllers and provide algorithms for selecting an efficient subset for testing. This is done for a finite set of candidate controllers and, at least for SISO plants, for compact infinite set. In doing this, the ν-gap metric will be the main tool. Computational examples are given, including one of certification of an aircraft engine controller. The overarching aim is to introduce truly MIMO margin calculations and to understand their efficacy in certifying stability over a set of controllers and in replacing legacy single-loop gain and phase margin calculations.     

A new delay system approach to network-based control

This paper presents a new delay system approach to network-based control. This approach is based on a new time-delay model proposed recently, which contains multiple successive delay components in the state. Firstly, new results on stability and H_∞ performance are proposed for systems with two successive delay components, by exploiting a new Lyapunov-Krasovskii functional and by making use of novel techniques for time-delay systems. An illustrative example is provided to show the advantage of these results. The second part of this paper utilizes the new model to investigate the problem of network-based control, which has emerged as a topic of significant interest in the control community. A sampled-data networked control system with simultaneous consideration of network induced delays, data packet dropouts and measurement quantization is modeled as a nonlinear time-delay system with two successive delay components in the state and, the problem of network-based H_∞ control is solved accordingly. Illustrative examples are provided to show the advantage and applicability of the developed results for network-based controller design.     

Krylov projection framework for Fourier model reduction

This paper analyzes the Fourier model reduction (FMR) method from a rational Krylov projection framework and shows how the FMR reduced model, which has guaranteed stability and a global error bound, can be computed in a numerically efficient and robust manner. By monitoring the rank of the Krylov subspace that underlies the FMR model, the projection framework also provides an improved criterion for determining the number of Fourier coefficients that are needed, and hence the size of the resulting reduced-order model. The advantages of applying FMR in the rational Krylov projection framework are demonstrated on a simple example.     

Multisensor switching control strategy with fault tolerance guarantees

In this paper we propose a novel fault tolerant multisensor switching strategy for feedback control. Each sensor of the proposed multisensor scheme has an associated state estimator which, together with a state feedback gain, is able to individually stabilise the closed-loop system. At each instant of time, the switching strategy selects the sensor-estimator pair that provides the best closed-loop performance, as measured by a control-performance criterion. We establish closed-loop stability of the resulting switching scheme under normal (fault-free) operating conditions. More importantly, we show that closed-loop stability is preserved in the presence of faulty sensors if a set of conditions on the system parameters (such as bounds on the sensor noises, maximum and minimum values of the reference signal, etc.) is satisfied. This result enhances and broadens the applicability of the proposed multisensor scheme since it provides guaranteed properties such as fault tolerance and robust closed-loop stability under sensor fault. The results are applied to the problem of automotive longitudinal control.