Improving the SMAC atmospheric correction code by analysis of Meteosat Second Generation NDVI and surface reflectance data

In order to obtain high quality data, the correction of atmospheric perturbations acting upon land surface reflectance measurements recorded by a space-based sensor is an important topic within remote sensing. For many years the Second Simulation of the Satellite Signal in the Solar Spectrum (6S) radiative transfer model and the Simplified Method for Atmospheric Correction (SMAC) codes have been used for this atmospheric correction, but previous studies have shown that in a number of situations the quality of correction provided by the SMAC is low. This paper describes a method designed to improve the quality of the SMAC atmospheric correction algorithm through a slight increase in its computational complexity. Data gathered from the SEVIRI aboard Meteosat Second Generation (MSG) is used to validate the additions to SMAC, both by comparison to simulated data corrected using the highly accurate 6S method and by comparison to in-situ and 6S corrected SEVIRI data gathered for two field sites in Africa. The additions to the SMAC are found to greatly increase the quality of atmospheric correction performed, as well as broaden the range of atmospheric conditions under which the SMAC can be applied. When examining the Normalised Difference Vegetation Index (NDVI), the relative difference between SMAC and in-situ values decreases by 1.5% with the improvements in place. Similarly, the mean relative difference between SMAC and 6S reflectance values decreases by a mean of 13, 14.5 and 8.5% for Channels 1, 2 and 3 respectively. Furthermore, the processing speed of the SMAC is found to remain largely unaffected, with only a small increase in the time taken to process a full SEVIRI scene. Whilst the method described within this paper is only applicable to SEVIRI data, a similar approach can be applied to other data sources than SEVIRI, and should result in a similar accuracy improvement no matter which instrument supplies the original data.     

Cognitive performance-altering effects of electronic medical records: an application of the human factors paradigm for patient safety

According to the human factors paradigm for patient safety, health care work systems and innovations such as electronic medical records do not have direct effects on patient safety. Instead, their effects are contingent on how the clinical work system, whether computerized or not, shapes health care providers’ performance of cognitive work processes. An application of the human factors paradigm to interview data from two hospitals in the Midwest United States yielded numerous examples of the performance-altering effects of electronic medical records, electronic clinical documentation, and computerized provider order entry. Findings describe both improvements and decrements in the ease and quality of cognitive performance, both for interviewed clinicians and for their colleagues and patients. Changes in cognitive performance appear to have desirable and undesirable implications for patient safety as well as for quality of care and other important outcomes. Cognitive performance can also be traced to interactions between work system elements, including new technology, allowing for the discovery of problems with “fit” to be addressed through design interventions.     

Document‐centric XML workflows with fragment digital signatures

The use of digital document management and processing is increasing. Traditional workflows of paper forms are being replaced by electronic workflows of digital documents. These workflows often require multiple signatures to be added to the documents for authorization and/or integrity. We describe examples of digital workflows that illustrate problems with digital signatures: i.e. the use of digital signatures across entire documents results in signatures that can be unnecessarily invalidated by subsequent modification of the document. We propose the use of fragment signatures, which reduce unnecessary invalidation of signatures and enable greater concurrency in workflows. Our approach is document‐centric and does not use a centralized database. We report on an implementation that allows fragment signatures over document fragments as well as the attachment (or embedding) of other documents. This allows collaborative or cooperative editing to occur on parts of a document without disturbing unrelated signatures. We describe the lessons learned from our deployments and offer further ways to embed such signatures into other document types. Copyright © 2010 John Wiley & Sons, Ltd.     

Confidence intervals for dependent data: Equating non-overlap with statistical significance

We revisit the problem of determining confidence interval widths for the comparison of means. For the independent two-sample (two-sided) case, Goldstein and Healy (1995) draw attention to the fact that comparisons based on 95% error bars are not very effective in assessing the statistical significance of the difference in means and derive the correct confidence interval for such a comparison. We provide an extension to Goldstein and Healy (1995) to account for the correlation structure and unequal variances. We use the results to develop rules of thumb for evaluating differences, in an exploratory manner, like Moses (1987) and Cumming (2009), from the independent case. We illustrate the method for the simple comparison of two means in a real data set, provide R code that may be easily implemented in practice, and discuss the extension of the method to other applied problems.     

Heuristics for the multi-period orienteering problem with multiple time windows

We present the multi-period orienteering problem with multiple time windows (MuPOPTW), a new routing problem combining objective and constraints of the orienteering problem (OP) and team orienteering problem (TOP), constraints from standard vehicle routing problems, and original constraints from a real-world application. The problem itself comes from a real industrial case. Specific route duration constraints result in a route feasibility subproblem. We propose an exact algorithm for this subproblem, and we embed it in a variable neighborhood search method to solve the whole routing problem. We then provide experimental results for this method. We compare them to a commercial solver. We also adapt our method to standard benchmark OP and TOP instances, and provide comparative tables with state-of-the-art algorithms.     

Variable neighborhood search for the dial-a-ride problem

In dial-a-ride problems passengers have to be transported between pre-specified pickup and delivery locations under user inconvenience considerations. The problem variant considered in this paper aims at minimizing total routing costs while respecting maximum route duration limits, time windows, and maximum user ride time limits. We propose a competitive variable neighborhood search-based heuristic, using three classes of neighborhoods. The first neighborhood class uses simple swap operations tailored to the dial-a-ride problem; the second neighborhood class is based on the ejection chain idea; and the third neighborhood class exploits the existence of arcs where the vehicle load is zero, giving rise to natural sequences of requests. We report new best results for 16 out of 20 benchmark instances.     

Passivity based control of a distributed PEM fuel cell model

This work considers the controlled load change of proton exchange membrane (PEM) fuel cells. Due to the intrinsic nonlinearities of fuel cells, load changes are quite challenging. In the case of a low temperature PEM fuel cell, there is the possibility of undesired liquid water formation. Most available control concepts are heuristic linear controller structures based on a perfectly mixed fuel cell model. In this work a nonlinear controller for one-dimensional spatially distributed model of a PEM fuel cell is presented. The fuel cell model is derived from first principles. The concept of passivity is used to design the controller. A suitable control Lyapunov function is chosen and passivity of the fuel cell is shown. A state-feedback law is derived that can guarantee stability of the closed-loop system over a wide range of operation conditions. In order to make the feedback law applicable to fuel cells with limited measurement information an observer is designed. In a final step the state-feedback law and the observer are combined to an output-feedback controller.     

MLP bilinear separation

In this paper, we present a thorough mathematical analysis of the use of neural networks to solve a specific classification problem consisting of a bilinear boundary. The network under consideration is a three-layered perceptron with two hidden neurons having the sigmoid serving as the activation function. The analysis of the hidden space created by the outputs of the hidden neurons will provide results on the network’s capacity to isolate two classes of data in a bilinear fashion, and the importance of the value of the sigmoid parameter is highlighted. We will obtain an explicit analytical function describing the boundary generated by the network, thus providing information on the effect each parameter has on the network’s behavior. Generalizations of the results are obtained with additional neurons, and a theorem concerned with analytical reproducibility of the boundary function is established.