Time complexity and convergence analysis of domain theoretic Picard method

We present an implementation of the domain-theoretic Picard method for solving initial value problems (IVPs) introduced by Edalat and Pattinson [1]. Compared to Edalat and Pattinson's implementation, our algorithm uses a more efficient arithmetic based on an arbitrary precision floating-point library. Despite the additional overestimations due to floating-point rounding, we obtain a similar bound on the convergence rate of the produced approximations. Moreover, our convergence analysis is detailed enough to allow a static optimisation in the growth of the precision used in successive Picard iterations. Such optimisation greatly improves the efficiency of the solving process. Although a similar optimisation could be performed dynamically without our analysis, a static one gives us a significant advantage: we are able to predict the time it will take the solver to obtain an approximation of a certain (arbitrarily high) quality.

Analysis of spatial patterns in histological sections of brain tissue using a method based on regression

A method of determining the spatial pattern of any histological feature in sections of brain tissue which can be measured quantitatively is described and compared with a previously described method. A measurement of a histological feature such as density, area, amount or load is obtained for a series of contiguous sample fields. The regression coefficient (β) is calculated from the measurements taken in pairs, first in pairs of adjacent samples and then in pairs of samples taken at increasing degrees of separation between them, i.e. separated by 2, 3, 4,..., n units. A plot of β versus the degree of separation between the pairs of sample fields reveals whether the histological feature is distributed randomly, uniformly or in clusters. If the feature is clustered, the analysis determines whether the clusters are randomly or regularly distributed, the mean size of the clusters and the spacing of the clusters. The method is simple to apply and interpret and is illustrated using simulated data and studies of the spatial patterns of blood vessels in the cerebral cortex of normal brain, the degree of vacuolation of the cortex in patients with Creutzfeldt-Jacob disease (CJD) and the characteristic lesions present in Alzheimer's disease (AD). Copyright (C) 2000 Elsevier Science B.V.

On being thrown into phenomenological research: a book review of J.A. Smith, P. Flowers & M. Larkin (2009) Interpretative Phenomenological Analysis: Theory, method and research. London: Sage.

Book review

Ranking efficient decision-making units in data envelopment analysis using fuzzy concept

This paper introduces a new mathematical method for improving the discrimination power of data envelopment analysis and to completely rank the efficient decision-making units (DMUs). Fuzzy concept is utilised. For this purpose, first all DMUs are evaluated with the CCR model. Thereafter, the resulted weights for each output are considered as fuzzy sets and are then converted to fuzzy numbers. The introduced model is a multi-objective linear model, endpoints of which are the highest and lowest of the weighted values. An added advantage of the model is its ability to handle the infeasibility situation sometimes faced by previously introduced models.

Another angle on contact lens surface analysis

Purpose: Dynamic contact angle (DCA) methods have advantages over other contact angle methodologies, not least that they can provide more than single contact angle values. Here we illustrate the use of DCA analysis to provide “fingerprint” characterisation of contact lens surfaces, and the way that different materials change in the early stages of wear. Method: The DCA method involves attaching to a microbalance weighted strips cut from a lens. The strips are then cyclically inserted into and removed from an aqueous solution. Conventionally, readings of force taken from linear portions of the resultant dipping curves are translated into advancing (CAa) and receding contact (CAr) angles. Additionally, analysis of the force versus immersion profile provides a “fingerprint” characterisation of the state of the lens surface. Results: CAa and CAr values from DCA traces provide a useful means of differentiating gross differences in hydrophilicity and molecular mobility of surfaces under particular immersion and emersion conditions, such as dipping rate and dwell times. Typical values for etafilcon A (CAa:63.1; CAr:37) and balafilcon B (CAa:118.4; CAr:36.4) illustrate this. Surface modifications induced in lens manufacture are observed to produce not only changes in these value, which may be small, but also changes in the DCA “fingerprint” (slope, undulations, length of plateau). Interestingly, similar changes are induced in the first few hours of lens wear with some lens-patient combinations. Conclusions: Although single parameter contact angles are useful for material characterisation, information of potential clinical interest can be obtained from more detailed analysis of DCA traces.

Incremental tensor biased discriminant analysis:a new color-based visual tracking method

Most existing color-based tracking algorithms utilize the statistical color information of the object as the tracking clues, without maintaining the spatial structure within a single chromatic image. Recently, the researches on the multilinear algebra provide the possibility to hold the spatial structural relationship in a representation of the image ensembles. In this paper, a third-order color tensor is constructed to represent the object to be tracked. Considering the influence of the environment changing on the tracking, the biased discriminant analysis (BDA) is extended to the tensor biased discriminant analysis (TBDA) for distinguishing the object from the background. At the same time, an incremental scheme for the TBDA is developed for the tensor biased discriminant subspace online learning, which can be used to adapt to the appearance variant of both the object and background. The experimental results show that the proposed method can track objects precisely undergoing large pose, scale and lighting changes, as well as partial occlusion. © 2009 Elsevier B.V.

Leontief Model Analysis with Fuzzy Parameters by Basic Matrixes Method

The basic matrixes method is suggested for the Leontief model analysis (LM) with some of its components indistinctly given. LM can be construed as a forecast task of product’s expenses-output on the basis of the known statistic information at indistinctly given several elements’ meanings of technological matrix, restriction vector and variables’ limits. Elements of technological matrix, right parts of restriction vector LM can occur as functions of some arguments. In this case the task’s dynamic analog occurs. LM essential complication lies in inclusion of variables restriction and criterion function in it.

Representational difference analysis:Critical appraisal and method development for the identification of unique DNA sequences from prokaryotes

Representational difference analysis (RDA) has great potential for preferential amplification of unique but uncharacterised DNA sequences present in one source such as a whole genome, but absent from a related genome or other complex population of sequences. While a few examples of its successful exploitation have been published, the method has not been well dissected and robust, detailed published protocols are lacking. Here we examine the method in detail, suggest improvements and provide a protocol that has yielded key unique sequences from a pathogenic bacterial genome. © 2003 Elsevier Science B.V. All rights reserved.

Comparative Analysis: A Feasible Software Engineering Method

The reasonable choice is a critical success factor for decision- making in the field of software engineering (SE). A case-driven comparative analysis has been introduced and a procedure for its systematic application has been suggested. The paper describes how the proposed method can be built in a general framework for SE activities. Some examples of experimental versions of the framework are brie y presented.

Optimal design of the renewable energy map of Greece using weighted goal-programming and data envelopment analysis

Renewable energy forms have been widely used in the past decades highlighting a "green" shift in energy production. An actual reason behind this turn to renewable energy production is EU directives which set the Union's targets for energy production from renewable sources, greenhouse gas emissions and increase in energy efficiency. All member countries are obligated to apply harmonized legislation and practices and restructure their energy production networks in order to meet EU targets. Towards the fulfillment of 20-20-20 EU targets, in Greece a specific strategy which promotes the construction of large scale Renewable Energy Source plants is promoted. In this paper, we present an optimal design of the Greek renewable energy production network applying a 0-1 Weighted Goal Programming model, considering social, environmental and economic criteria. In the absence of a panel of experts Data Envelopment Analysis (DEA) approach is used in order to filter the best out of the possible network structures, seeking for the maximum technical efficiency. Super-Efficiency DEA model is also used in order to reduce the solutions and find the best out of all the possible. The results showed that in order to achieve maximum efficiency, the social and environmental criteria must be weighted more than the economic ones.