Size-reduction heuristics for the unrelated parallel machines scheduling problem

In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job differs from machine to machine. We deal with the objective of the minimisation of the maximum completion time of the jobs, usually referred to as makespan or C_max. This is a type of assignment problem that has been frequently studied in the scientific literature due to its many potential applications. We propose a set of metaheuristics based on a size-reduction of the original assignment problem that produce solutions of very good quality in a short amount of time. The underlying idea is to consider only a few of the best possible machine assignments for the jobs and not all of them. The results are simple, yet powerful methods. We test the proposed algorithms with a large benchmark of instances and compare them with current state-of-the-art methods. In most cases, the proposed size-reduction algorithms produce results that are statistically proven to be better by a significant margin.     

A decision support system for the diagnosis of melanoma: A comparative approach

Melanoma is the most deathful of all skin cancers and the number of cases grows every year. The extirpation in early phases implies a high degree of survival so it is fundamental to diagnose it as soon as possible. In this paper we present a clinical decision support system for melanoma diagnosis using as input an image set of the skin lesion to be diagnosed. The system analyses the image sequence to extract the affected area, determinates the characteristics which indicate the degree of damage and, according to them, it makes a decision. Several methods of classification are proposed: a multilayered perceptron, a Bayesian classifier and the algorithm of the K nearest neighbours. These methods work independently and also in combination making a collaborative decision support system. The classification rates obtained are around 87%.     

A case study about the improvement of business process models driven by indicators

Organizations are increasingly concerned about business process model improvement in their efforts to guarantee improved operational efficiency. Quality assurance of business process models should be addressed in the most objective manner, e.g., through the application of measures, but the assessment of measurement results is not a straightforward task and it requires the identification of relevant indicators and threshold values, which are able to distinguish different levels of process model quality. Furthermore, indicators must support the improvements of the models by using suitable guidelines. In this paper, we present a case study to evaluate the BPMIMA framework for BP model improvement. This framework is composed of empirically validated measures related to quality characteristics of the models, a set of indicators with validated thresholds associated with modeling guidelines and a prototype supporting tool. The obtained data suggest that the redesign by applying guidelines driven by the indicator results was successful, as the understandability and modifiability of the models were improved. In addition, the changes in the models according to guidelines were perceived as acceptable by the practitioners who participated in the case study.     

State of the art of frameworks and middleware for facilitating mobile and ubiquitous learning development

The emergence of mobile and ubiquitous technologies as important tools to complement formal learning has been accompanied by a growing interest in their educational benefits and applications. Mobile devices can be used to promote learning anywhere and anytime, to foster social learning and knowledge sharing, or to visualize augmented reality applications for learning purposes. However, the development of these applications is difficult for many researchers because it requires understanding many different protocols; dealing with distributed schemas, processes, platforms, and services; learning new programming languages; and interacting with different hardware sensors and drivers. For that reason, the use of frameworks and middleware that encapsulate part of this complexity appears to be fundamental to the further development of mobile learning projects. This study analyzes the state of the art of frameworks and middleware devoted to simplifying the development of mobile and ubiquitous learning applications. The results can be useful to many researchers involved in the development of projects using these technologies by providing an overview of the features implemented in each of these frameworks.     

Adaptive observers for unknown general nonlinear systems

Several neural network (NN) models have been applied successfully for modeling complex nonlinear dynamical systems. However, the stable adaptive state estimation of an unknown general nonlinear system from its input and output measurements is an unresolved problem. This paper addresses the nonlinear adaptive observer design for unknown general nonlinear systems. Only mild assumptions on the system are imposed: output equation is at least C(1) and existence and uniqueness of solution for the state equation. The proposed observer uses linearly parameterized neural networks (LPNNs) whose weights are adaptively adjusted, and Lyapunov theory is used in order to guarantee stability for state estimation and NN weight errors. No strictly positive real (SPR) assumption on the output error equation is required for the construction of the proposed observer.     

On Nonparametric Residual Variance Estimation

In this paper, the problem of residual variance estimation is examined. The problem is analyzed in a general setting which covers non-additive heteroscedastic noise under non-iid sampling. To address the estimation problem, we suggest a method based on nearest neighbor graphs and we discuss its convergence properties under the assumption of a Hölder continuous regression function. The universality of the estimator makes it an ideal tool in problems with only little prior knowledge available.     

Influence of photoperiod on carbon dioxide and methane emissions from two pilot-scale stabilization ponds

Greenhouse gas (GHG) emissions (CO(2), CH(4)) from pilot-scale algal and duckweed-based ponds (ABP and DBP) were measured using the static chamber methodology. Daylight and nocturnal variations of GHG and wastewater characteristics (e.g. chemical oxygen demand (COD), pH) were determined via sampling campaigns during midday (12:30-15:30) and midnight (00:30-03:30) periods. The results showed that under daylight conditions in ABP median emissions were -232 mg CO(2) m(-2) d(-1) and 9.9 mg CH(4) m(-2) d(-1), and in DBP median emissions were -1,654.5 mg CO(2) m(-2) d(-1) and 71.4 mg CH(4) m(-2) d(-1), respectively. During nocturnal conditions ABP median emissions were 3,949.9 mg CO(2) m(-2) d(-1), 12.7 mg CH(4) m(-2) d(-1), and DBP median emissions were 5,116 mg CO(2) m(-2) d(-1), 195.2 mg CH(4) m(-2) d(-1), respectively. Once data measured during daylight were averaged together with nocturnal data the median emissions for ABP were 1,566.8 mg CO(2) m(-2) d(-1) and 72.1 mg CH(4) m(-2) d(-1), whilst for DBP they were 3,016.9 mg CO(2) m(-2) d(-) and 178.9 mg CH(4) m(-2) d(-1), respectively. These figures suggest that there were significant differences between CO(2) emissions measured during daylight and nocturnal periods (p < 0.05). This shows a sink-like behaviour for both ABP and DBP in the presence of solar light, which indicates the influence of photosynthesis in CO(2) emissions. On the other hand, the fluxes of CH(4) indicated that DBP and ABP behave as net sources of CH(4) during day and night, although higher emissions were observed from DBP. Overall, according to the compound average (daylight and nocturnal emissions) both ABP and DBP systems might be considered as net sources of GHG.     

A VNS heuristic for escaping local extrema entrapment in normalized cut clustering

Normalized cut is one of the most popular graph clustering criteria. The main approaches proposed for its resolution are spectral clustering methods and a multilevel approach of Dhillon et al. (TPAMI 29:1944–1957, 2007), called graclus. Their aim is to obtain good solutions in a small amount of time for large instances. Metaheuristics are general frameworks for stochastic searches often employed in global optimization to improve the solutions obtained by other heuristics. Variable neighborhood search (VNS) is a metaheuristic which exploits systematically the idea of neighborhood change during the search. In this paper, we propose a VNS heuristic for normalized cut segmentation. Computational experiments show that in most cases this VNS heuristic improves significantly, and in moderate time, the solutions obtained by the current state-of-the-art algorithms, i.e., graclus and a spectral method proposed by Yu and Shi (ICCV, 2003).