Handling Inconsistency In Distributed Software Requirements Specifications Based On Prioritized Merging

Developing a desirable framework for handling inconsistencies in software requirements specifications is a challenging problem. It has been widely recognized that the relative priority of requirements can help developers to make some necessary trade-off decisions for resolving con- flicts. However, for most distributed development such as viewpoints-based approaches, different stakeholders may assign different levels of priority to the same shared requirements statement from their own perspectives. The disagreement in the local levels of priority assigned to the same shared requirements statement often puts developers into a dilemma during the inconsistency handling process. The main contribution of this paper is to present a prioritized merging-based framework for handling inconsistency in distributed software requirements specifications. Given a set of distributed inconsistent requirements collections with the local prioritization, we first construct a requirements specification with a prioritization from an overall perspective. We provide two approaches to constructing a requirements specification with the global prioritization, including a merging-based construction and a priority vector-based construction. Following this, we derive proposals for handling inconsistencies from the globally prioritized requirements specification in terms of prioritized merging. Moreover, from the overall perspective, these proposals may be viewed as the most appropriate to modifying the given inconsistent requirements specification in the sense of the ordering relation over all the consistent subsets of the requirements specification. Finally, we consider applying negotiation-based techniques to viewpoints so as to identify an acceptable common proposal from these proposals.

Modelling the mechanical response of the Reed-mouthpiece-lip system of a clarinet. Part I. A one-dimensional distributed model

The motion of a clarinet reed that is clamped to a mouthpiece and supported by a lip is simulated in the time-domain using finite difference methods. The reed is modelled as a bar with non-uniform cross section, and is described using a one-dimensional, fourth-order partial differential equation. The interactions with the mouthpiece Jay and the player's lip are taken into account by incorporating conditional contact forces in the bar equation. The model is completed by clamped-free boundary conditions for the reed. An implicit finite difference method is used for discretising the system, and values for the physical parameters are chosen both from laboratory measurements and by accurate tuning of the numerical simulations. The accuracy of the numerical system is assessed through analysis of frequency warping effects and of resonance estimation. Finally, the mechanical properties of the system are studied by analysing its response to external driving forces. In particular, the effects of reed curling are investigated.

Dust ion acoustic solitons in a plasma with kappa-distributed electrons

Dust ion acoustic solitons in an unmagnetized dusty plasma comprising cold dust particles, adiabatic fluid ions, and electrons satisfying a kappa distribution are investigated using both small amplitude and arbitrary amplitude techniques. Their existence domain is discussed in the parameter space of Mach number M and electron density fraction f over a wide range of values of kappa. For all kappa > 3/2, including the Maxwellian distribution, negative dust supports solitons of both polarities over a range in f. In that region of parameter space solitary structures of finite amplitude can be obtained even at the lowest Mach number, the acoustic speed, for all kappa. These cannot be found from small amplitude theories. This surprising behavior is investigated, and it is shown that f(c), the value of f at which the KdV coefficient A vanishes, plays a critical role. In the presence of positive dust, only positive potential solitons are found. (C) 2010 American Institute of Physics. [doi: 10.1063/1.3400229]

Dynamic evolution of the genetic search region through fuzzy coding

A technique for automatic exploration of the genetic search region through fuzzy coding (Sharma and Irwin, 2003) has been proposed. Fuzzy coding (FC) provides the value of a variable on the basis of the optimum number of selected fuzzy sets and their effectiveness in terms of degree-of-membership. It is an indirect encoding method and has been shown to perform better than other conventional binary, Gray and floating-point encoding methods. However, the static range of the membership functions is a major problem in fuzzy coding, resulting in longer times to arrive at an optimum solution in large or complicated search spaces. This paper proposes a new algorithm, called fuzzy coding with a dynamic range (FCDR), which dynamically allocates the range of the variables to evolve an effective search region, thereby achieving faster convergence. Results are presented for two benchmark optimisation problems, and also for a case study involving neural identification of a highly non-linear pH neutralisation process from experimental data. It is shown that dynamic exploration of the genetic search region is effective for parameter optimisation in problems where the search space is complicated.