Adjustable parameter-based multi-objective fault estimation observer design for continuous-time/discrete-time dynamic systems

This paper addresses an adjustable parameter (AP)-based multi-objective fault estimation design for continuous-time/discrete-time dynamic systems. First, a fault estimation observer with AP is constructed to on-line identify the size of occurred faults. The fault estimation design not only possesses a wider application compared with adaptive observers, but also uses the current output information to enhance fault estimation performance. Then a multi-objective approach is proposed to determine the gain matrices of fault estimation observer. Moreover, fault estimation results with the slack-variable technique are obtained to further reduce the conservatism. Finally, simulation results of an aircraft application are presented to illustrate the effectiveness of our contribution.     

Fast computation of minimal elementary decompositions of metabolic flux vectors

The concept of elementary flux vector is valuable in a number of applications of metabolic engineering. For instance, in metabolic flux analysis, each admissible flux vector can be expressed as a non-negative linear combination of a small number of elementary flux vectors. However a critical issue concerns the total number of elementary flux vectors which may be huge because it combinatorially increases with the size of the metabolic network. In this paper we present a fast algorithm that randomly computes a decomposition of admissible flux vectors in a minimal number of elementary flux vectors without explicitly enumerating all of them.     

A multiphase compressible model for the simulation of multiphase flows

A compressible model able to manage incompressible two-phase flows as well as compressible motions is proposed. After a presentation of the multiphase compressible concept, the new model and related numerical methods are detailed on fixed structured grids. The presented model is a 1-fluid model with a reformulated mass conservation equation which takes into account the effects of compressibility. The coupling between pressure and flow velocity is ensured by introducing mass conservation terms in the momentum and energy equations. The numerical model is then validated with four test cases involving the compression of an air bubble by water, the liquid injection in a closed cavity filled with air, a bubble subjected to an ultrasound field and finally the oscillations of a deformed air bubble in melted steel. The numerical results are compared with analytical results and convergence orders in space are provided.     

A novel linearly-weighted gradient smoothing method (LWGSM) in the simulation of fluid dynamics problem

This paper describes a novel linearly-weighted gradient smoothing method (LWGSM). The proposed method is based on irregular cells and thus can be used for problems with arbitrarily complex geometrical boundaries. Based on the analysis about the compactness and the positivity of coefficients of influence of their stencils for approximating a derivative, one favorable scheme (VIII) is selected among total eight proposed discretization schemes. This scheme VIII is successively verified and carefully examined in solving Poisson equations, subjected to changes in the number of nodes, the shapes of cells and the irregularity of triangular cells, respectively. Strong form of incompressible Navier–Stokes equations enhanced with artificial compressibility terms are tackled, in which the spatial derivatives are approximated by consistent and successive use of gradient smoothing operation over smoothing domains at various locations. All the test cases using LWGSM solver exhibits its robust, stable and accurate behaviors. The attained incompressible LWGSM solutions show good agreements with experimental and literature data. Therefore, the proposed LWGSM can be reliably used for accurate solutions to versatile fluid flow problems.     

How to improve snap-stabilizing point-to-point communication space complexity?

A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in the message forwarding problem in a message-switched network in which the system resources must be managed in order to deliver messages to any processor of the network. To this end, we use the information provided by a routing algorithm. In the context of an arbitrary initialization (due to stabilization), this information may be corrupted. In Cournier et al. (2009) [1], we show that there exist snap-stabilizing algorithms for this problem (in the state model). This implies that we can request the system to begin forwarding messages without losses even if routing information is initially corrupted.In this paper, we propose another snap-stabilizing algorithm for this problem which improves the space complexity of the one in Cournier et al. (2009) [1].     

Is team training in briefings for surgical teams feasible in simulation?

We developed a module for surgical team training using briefings in simulated crisis scenarios and here we report preliminary findings. Nine surgical teams (34 trainees) participated in a pre-training simulation, followed by an interactive workshop on briefing and checklists, and then a post-training simulation. Both technical and non-technical skills were assessed via observation during simulations by expert trainers who provided feedback on performances at the end of simulation. Trainees also reported their attitudes to briefings and evaluated the training. Pre-training attitudes to briefing were positive, some of which improved post-training and trainees’ evaluation of the training was positive. Surgeons’ technical skill improved significantly post-training, but their decision-making skill was rated lower than other non-technical skills, compared to other trainees. The training did not appear to greatly improve non-technical skill performance. Training surgical teams in simulation is feasible but much more work is needed on measurement development and training strategy to confirm its efficacy and utility.     

Instrument-Specific Harmonic Atoms for Mid-Level Music Representation

Several studies have pointed out the need for accurate mid-level representations of music signals for information retrieval and signal processing purposes. In this paper, we propose a new mid-level representation based on the decomposition of a signal into a small number of sound atoms or molecules bearing explicit musical instrument labels. Each atom is a sum of windowed harmonic sinusoidal partials whose relative amplitudes are specific to one instrument, and each molecule consists of several atoms from the same instrument spanning successive time windows. We design efficient algorithms to extract the most prominent atoms or molecules and investigate several applications of this representation, including polyphonic instrument recognition and music visualization.     

The effects of container size, frequency and extended horizontal reach on maximum acceptable weights of lifting for female industrial workers

In the development of our present manual materials handling (MMH) guidelines (Snook, S.H., Ciriello, V.M., 1991. The design of manual tasks: revised tables of maximum acceptable weights and forces. Ergonomics 34, 1197-1213), the assumption was made that the effects of frequency on maximum acceptable weights (MAWs) of lifting with a large box (hand distance, 38 cm from chest) were similar to that of lifting with a small box (hand distance, 17 cm from chest). The first purpose of the present experiment was to investigate this assumption with female industrial workers. The second purpose was to study the effects of extended horizontal reach lifting (hand distance, 44.6 cm from chest) on MAWs as a confirmation of the results of a previous studies on this variable with males (Ciriello, V.M., Snook, S.H., Hughes, G.J., 1993. Further studies of psychophysically determined maximum acceptable weights and forces. Hum. Factors 35(1), 175-186; Ciriello, V.M., 2003. The effects of box size, frequency, and extended horizontal reach on maximum acceptable weights of lifting. Int. J. Ind. Ergon. 32, 115-120). Lastly, we studied the effects of high frequency (20 lifts/min) on MAWs of lifting. Ten female industrial workers performed 15 variations of lifting using our psychophysical methodology whereby the subjects were asked to select a workload they could sustain for 8h without "straining themselves or without becoming unusually tired weakened, overheated or out of breath". The results confirmed that MAWs of lifting with the large box was significantly effected by frequency. The frequency factor pattern in this study was similar to the frequency pattern from a previous study using the small box (Ciriello, V.M., Snook, S.H., 1983. A study of size distance height, and frequency effects on manual handling tasks. Hum. Factors 25(5), 473-483) for all fast frequencies down to one lift every 2 min with deviations of 7%, 15%, and 13% for the one lift every 5 and 30 min tasks and the one lift in 8h task, respectively. The effects of lifting with an extended horizontal reach decreased MAW 22% and 18% for the mid and center lift and the effects of the 20 lifts/min frequency resulted in a MAW that was 47% of a 1 lift/min MAW. Incorporating these results in future guidelines should improve the design of MMH tasks for female workers.     

Snap-stabilization and PIF in tree networks

The contribution of this paper is threefold. First, we present the paradigm of snap-stabilization. A snap- stabilizing protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves according to its specification. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes in 0 rounds). Second, we propose a new Propagation of Information with Feedback (PIF) cycle, called Propagation of Information with Feedback and Cleaning (). We show three different implementations of this new PIF. The first one is a basic cycle which is inherently snap-stabilizing. However, the first PIF cycle can be delayed O(h ²) rounds (where h is the height of the tree) due to some undesirable local states. The second algorithm improves the worst delay of the basic algorithm from O(h ²) to 1 round. The state requirement for the above two algorithms is 3 states per processor, except for the root and leaf processors that use only 2 states. Also, they work on oriented trees. We then propose a third snap-stabilizing PIF algorithm on un-oriented tree networks. The state requirement of the third algorithm depends on the degree of the processors, and the delay is at most h rounds. Next, we analyze the maximum waiting time before a PIF cycle can be initiated whether the PIF cycle is infinitely and sequentially repeated or launch as an isolated PIF cycle. The analysis is made for both oriented and un-oriented trees. We show or conjecture that the two best of the above algorithms produce optimal waiting time. Finally, we compute the minimal number of states the processors require to implement a single PIF cycle, and show that both algorithms for oriented trees are also (in addition to being time optimal) optimal in terms of the number of states. WARNING: The concept of snap-stabilization was first introduced in [12]. The concept evolved over the last eight years. We take this evolution in consideration in this paper, which includes the early results published in [10] and [12]. In particular, infinite repetition of computation cycles is a requirement of self-stabilizing systems. This is not required in snap-stabilization because snap-stabilization ensures that the first completed computation cycle is executed according to the specification of the problem. The correctness proofs conform to this basic property.