Clustering techniques applied to multiple-models structures

In this work a method for building multiple-model structures is presented. A clustering algorithm that uses data from the system is employed to define the architecture of the multiple-model, including the size of the region covered by each model, and the number of models. A heating ventilation and air conditioning system is used as a testbed of the proposed method.

Dimension and coverage of multiple-models structures using clustering techniques

In this work a method for building multiple-model structures is presented. A clustering algorithm that uses data from the system is employed to define the architecture of the multiple-model, including the size of the region covered by each model, and the number of models. A heating ventilation and air conditioning system is used as a testbed of the proposed method.

Different splitting techniques with application to air pollution models

Splitting techniques are commonly used when large-scale models, which appear in different fields of science and engineering, are treated numerically. Four types of splitting procedures are defined and discussed. The problem of the choice of a splitting procedure is investigated. Several numerical tests, by which the influence of the splitting errors on the accuracy of the results is studied, are given. It is shown that the splitting errors decrease linearly when (1) the splitting procedure is of first order and (2) the splitting errors are dominant. Three examples for splitting procedures used in all large-scale air pollution models are presented. Numerical results obtained by a particular air pollution model, Unified Danish Eulerian Model (UNI-DEM), are given and analysed.

Search space pruning and global optimisation of Multiple Gravity Assist spacecraft trajectories

We introduce and describe the Multiple Gravity Assist problem, a global optimisation problem that is of great interest in the design of spacecraft and their trajectories. We discuss its formalization and we show, in one particular problem instance, the performance of selected state of the art heuristic global optimisation algorithms. A deterministic search space pruning algorithm is then developed and its polynomial time and space complexity derived. The algorithm is shown to achieve search space reductions of greater than six orders of magnitude, thus reducing significantly the complexity of the subsequent optimisation.

Stubs versus swabs? A comparison of gunshot residue collection techniques

The collection efficiency of two widely used gunshot residue (GSR) collection techniques—carbon-coated adhesive stubs and alcohol swabs—has been compared by counting the number of characteristic GSR particles collected from the firing hand of a shooter after firing one round. Samples were analyzed with both scanning electron microscopy and energy dispersive X-rays by an experienced GSR analyst, and the number of particles on each sample containing Pb, Ba, and Sb counted. The adhesive stubs showed a greater collection efficiency as all 24 samples gave positive results for GSR particles whereas the swabs gave only positive results for half of the 24 samples. Results showed a statistically significant collection efficiency for the stub collection method and likely reasons for this are considered.