Robust invariant sets for constrained storage systems

Several items are produced and stored into n buffers in order to supply an external demand without interruptions. We consider the classical problem of determining control laws and smallest buffer levels guaranteeing that an unknown bounded demand is always satisfied. A simple model with n decoupled integrators and n additive bounded disturbances is employed. The coupling arises from bounds on the total production capacity and on the total demand. Invariant set theory for linear and switched linear systems is exploited to compute robust positive invariant sets and controlled robust invariant sets for two commonly adopted scheduling policies. This paper provides the explicit expression of the invariant sets for any arbitrary n.     

Pattern analysis of dermoscopic images based on Markov random fields

In this paper a method for detecting different patterns in dermoscopic images is presented. In order to diagnose a possible skin cancer, physicians assess the lesion based on different rules. While the most famous one is the ABCD rule (asymmetry, border, colour, diameter), the new tendency in dermatology is to classify the lesion performing a pattern analysis. Due to the colour textured appearance of these patterns, this paper presents a novel method based on Markov random field (MRF) extended for colour images that classifies images representing different dermatologic patterns. First, each image plane in L^*a^*b^* colour space is modelled as a MRF following a finite symmetric conditional model (FSCM). Coupling of colour components is taken into account by supposing that features of the MRF in the three colour planes follow a multivariate Normal distribution. Performance is analysed in different colour spaces. The best classification rate is 86% on average.     

The complementary exponential geometric distribution: Model, properties, and a comparison with its counterpart

In this paper, we proposed a new two-parameter lifetime distribution with increasing failure rate, the complementary exponential geometric distribution, which is complementary to the exponential geometric model proposed by Adamidis and Loukas (1998). The new distribution arises on a latent complementary risks scenario, in which the lifetime associated with a particular risk is not observable; rather, we observe only the maximum lifetime value among all risks. The properties of the proposed distribution are discussed, including a formal proof of its probability density function and explicit algebraic formulas for its reliability and failure rate functions, moments, including the mean and variance, variation coefficient, and modal value. The parameter estimation is based on the usual maximum likelihood approach. We report the results of a misspecification simulation study performed in order to assess the extent of misspecification errors when testing the exponential geometric distribution against our complementary one in the presence of different sample size and censoring percentage. The methodology is illustrated on four real datasets; we also make a comparison between both modeling approaches.     

Groundwater Model Calibration by Meta-Heuristic Algorithms

Groundwater models are computer models that simulate or predict aquifer conditions by using input data sets and hydraulic parameters. Commonly, hydraulic parameters are extracted by calibration, using observed and simulated aquifer conditions. The accuracy of calibration affects other modeling processes, especially the hydraulic head simulation. Meta-heuristic algorithms are good candidates to determine optimal/near-optimal parameters in groundwater models. In this paper, two meta-heuristic algorithms: (1) particle swarm optimization (PSO) and (2) pattern search (PS) are applied and compared in the Ghaen aquifer, by considering the sum of the squared deviation (SSD) between observed and simulated hydraulic heads and the sum of the absolute value of deviation (SAD) between observed and simulated hydraulic heads as the objective functions. Results show that obtained values of the objective function are enhanced significantly by using the PS algorithm. Accordingly, PS improves (decreases) the SSD and SAD by 0.20 and 2.36 percent, respectively, compared to results reported by using the PSO algorithm. Results also indicate that the proposed PS optimization tool is effective in the calibration of aquifer parameters.     

Discussion of “Assessments of Impacts of Climate Change and Human Activities on Runoff with SWAT for the Huifa River Basin, Northeast China” by Aijing Zhang; Chi Zhang; Guobin Fu; Bende Wang; Zhenxin Bao; and Hongxing Zheng

Zhang et al. (Water Resour Manag doi:10.1007/s11269-012-0182-2, 2012) studied the impacts of climate change and human activities on the runoff for the Huifa River basin. They employed a soil and water assessment tool (SWAT), which was calibrated for the baseline period 1956–1964, and then used to reconstruct the natural runoff for the climate change period 1965–2000. Results showed that both climate change and human activities decrease the observed runoff. Climate change impacts on annual runoff were ?37.7, ?59.5, +36.9, and ?45.2 mm/a for 1965–1975, 1976–1985, 1986–1995, and 1996–2005 respectively, compared with the baseline period 1956–1964. Human activities decreased runoff and caused a relatively larger magnitude impact than those of climate change after 1985. Human activities decreased the annual runoff by ?32.9, ?46.8, ?67.8, and ?54.9 mm/a for 1965–1975, 1976–1985, 1986–1995, and 1996–2005 respectively. Human activities further decreased runoff in wet years due to regulation and storage of water projects.     

Algorithm for Increasing the Speed of Evolutionary Optimization and its Accuracy in Multi-objective Problems

Optimization algorithms are important tools for the solution of combinatorial management problems. Nowadays, many of those problems are addressed by using evolutionary algorithms (EAs) that move toward a near-optimal solution by repetitive simulations. Sometimes, such extensive simulations are not possible or are costly and time-consuming. Thus, in this study a method based on artificial neural networks (ANN) is proposed to reduce the number of simulations required in EAs. Specifically, an ANN simulator is used to reduce the number of simulations by the main simulator. The ANN is trained and updated only for required areas in the decision space. Performance of the proposed method is examined by integrating it with the non-dominated sorting genetic algorithm (NSGAII) in multi-objective problems. In terms of density and optimality of the Pareto front, the hybrid NSGAII-ANN is able to extract the Pareto front with much less simulation time compared to the sole use of the NSGAII algorithm. The proposed NSGAII-ANN methodology was examined using three standard test problems (FON, KUR, and ZDT1) and one real-world problem. The latter addresses the operation of a reservoir with two objectives (meeting demand and flood control). Thus, based on this study, use of the NSGAII-ANN integrative algorithm in problems with time-consuming simulators reduces the required time for optimization up to 50 times. Results of the real-world problem, despite lower computational-time requirements, show a performance similar to that achieved in the aforementioned test problems.     

Self-Organising Maps: A new way to screen the level of satisfaction of dialysis patients

Evaluation of patient satisfaction has become an important indicator for assessing health care quality. Fresenius Medical Care (FME) as a global provider of dialysis services through its NephroCare network has a strong interest in monitoring patient satisfaction.The aim of the paper is to test and validate a methodology for detecting a residual area of low satisfaction in dialysis patients.The FME Patient Satisfaction Programme questionnaire was distributed to haemodialysis (HD) patients treated in 335 centers of its network. It contained 79 questions covering various satisfaction aspects regarding Dialysis Unit, Dialysis Arrangement, Nurses, Doctors, etc.To analyse the data provided by the questionnaire, the Self-Organising Map (SOM) method was used. SOM is a neural network model for clustering and projecting high-dimensional data into a low-dimensional space, preserving topological relationships of original high-dimensional data spaces.10,632 HD patients completed the questionnaire. Mean age was 63.05 ± 14.93 years with 56.69% males. Response rate was 66%. Overall level of satisfaction was 1.99 (range from ?3 to +3). On average patients were very satisfied with all issues. Nevertheless, a group of patients, around 60 years old, balanced gender ratio, whose level of satisfaction was lower than 1, were highlighted.In the NephroCare clinics patient satisfaction with service is rather high. While traditional analysis usually stops here, the SOM method allows identification of areas of potential improvement for specific patient groups.     

Positive N-periodic descriptor control systems

A small-gain theorem is presented for almost global stability of monotone control systems which are open-loop almost globally stable, when constant inputs are applied. The theorem assumes “negative feedback” interconnections. This typically destroys the monotonicity of the original flow and potentially destabilizes the resulting closed-loop system.     

Super‐resolution of the undersampled and subpixel shifted image sequence by a neural network

Numerous approaches to super‐resolution (SR) of sequentially observed images (image sequence) of low resolution (LR) have been presented in the past two decades. However, neural network methods are almost ignored for solving SR problems. This is because the SR problem traditionally has been regarded as the optimization of an ill‐posed large set of linear equations. A designed neural network based on this has a large number of neurons, thereby requiring a long learning time. Also, the deduced cost function is overly complex. These defects limit applications of a neural network to an SR problem. We think that the underlying meaning of the SR problem should refer to super‐resolving an imaging system by image sequence observation, instead of merely improving the image sequence itself. SR can be regarded as a pattern mapping from LR to SR images. The parameters of the pattern mapping can be learned from the imaging process of the image sequence. This article presents a neural network for SR based on learning from the imaging process of the image sequence. In order to speed up the convergence, we employ vector mapping to train the neural network. A mapping vector is composed of some neighbor subpixels. Such a well‐trained neural network has powerful generalization ability so that it can be used directly to estimate the SR image of the other image sequences without learning again. Our simulations show the effectiveness of the proposed neural network. © 2004 Wiley Periodicals, Inc. Int J Imaging Syst Technol 14, 8–15, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ima.20001     

Cognitive Trauma Therapy for Battered Women With PTSD (CTT-BW).

This article describes a second treatment-outcome study of cognitive trauma therapy for battered women with posttraumatic stress disorder (PTSD; CTT-BW). CTT-BW includes trauma history exploration: PTSD education; stress management; exposure to abuse and abuser reminders; self-monitoring of negative self-talk; cognitive therapy for guilt; and modules on self-advocacy, assertiveness, and how to identify perpetrators. One hundred twenty-five ethnically diverse women were randomly assigned to immediate or delayed CTT-BW. PTSD remitted in 87% of women who completed CTT-BW, with large reductions in depression and guilt and substantial increases in self-esteem. White and ethnic minority women benefited equally from CTT-BW. Similar treatment outcomes were obtained by male and female therapists and by therapists with different levels of education and training. Gains were maintained at 3- and 6-month follow-ups. (PsycINFO Database Record (c) 2010 APA, all rights reserved)