A multiobjective approach based on artificial bee colony for the static routing and wavelength assignment problem

Nowadays, the most promising technology for designing optical networks is the wavelength division multiplexing. This technique divides the huge bandwidth of an optical fiber link into different wavelengths, providing different available channels per link. However, a problem comes up when it is necessary to interconnect a set of traffic demands. This problem is known as routing and wavelength assignment problem, and due to its complexity (NP-hard problem) it is very suitable for being solved using evolutionary computation. The selected heuristics is the artificial bee colony algorithm, an heuristics based on the behavior of honeybee foraging for nectar. Therefore, we have applied multiobjective optimization to solve the static routing and wavelength assignment problem, and adapted this algorithm to the multiobjective context. New results have been obtained that significantly improve those published in previous researches.     

Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics

In this work, a review and comprehensive evaluation of heuristics and metaheuristics for the m-machine flowshop scheduling problem with the objective of minimising total tardiness is presented. Published reviews about this objective usually deal with a single machine or parallel machines and no recent methods are compared. Moreover, the existing reviews do not use the same benchmark of instances and the results are difficult to reproduce and generalise. We have implemented a total of 40 different heuristics and metaheuristics and we have analysed their performance under the same benchmark of instances in order to make a global and fair comparison. In this comparison, we study from the classical priority rules to the most recent tabu search, simulated annealing and genetic algorithms. In the evaluations we use the experimental design approach and careful statistical analyses to validate the effectiveness of the different methods tested. The results allow us to clearly identify the state-of-the-art methods.     

Recognition of circular patterns on GPUs: Performance analysis and contributions

We develop a novel approach for computing the circle Hough transform entirely on graphics hardware (GPU). A primary role is assigned to vertex processors and the rasterizer, overshadowing the traditional foreground of pixel processors and enhancing parallel processing. Resources like the vertex cache or blending units are studied too, with our set of optimizations leading to extraordinary peak gain factors exceeding 358x over a typical CPU execution. Software optimizations, like the use of precomputed tables or gradient information and hardware improvements, like hyperthreading and multicores are explored on CPUs as well. Overall, the GPU exhibits better scalability and much greater parallel performance to become a solid alternative for computing the classical circle Hough transform versus those optimal methods run on emerging multicore architectures.     

Use of Ontologies as Representation Support of Workflows Oriented to Administrative Management

One of the applications of workflow systems is the management of administrative processes characterized by the transmission of information elements among users of an organization. Tasks contained in these processes are carried out by users responsible for confirming, modifying or adding information throughout. These processes need to be defined in workflow management systems in which all the elements are perfectly identified and are easily adaptable to changes that may arise in the sequences of tasks, in the users involved or in the data transmitted from one task to another. For this kind of processes is easier to reuse those represented in ontologies. On one hand, existing ontologies for representing some domain elements can be reused. At the same time, ontologies have an excellent expressive capacity to define tasks, their relationships and the flow control among them with precision. This paper proposes a complete model, together with the necessary software tools, for tackling this issue.

Synthesis of symmetric and asymmetric singly terminated elliptic ladder filters for multiplexing applications

An extension of the Cauer ladder development for synthesizing singly terminated filters with symmetric and asymmetric responses is presented. Basically, a driving‐point immittance including reactive constant elements is carried out in such a way that provides the transmission zeros. The reactive constant elements are introduced into the synthesis for two reasons. The first is to consider the possibility of the asymmetric position of transmission zeros in the real frequency axis. The second one is to obtain canonical forms, i.e. networks with the minimum number of elements in the case of symmetrical responses. To validate the proposed method, a filter with asymmetrical response has been synthesized, comparing different topologies for its use in multiplexers. This fact is illustrated with a Ku‐band elliptic response diplexer designed in H‐plane rectangular waveguide. © 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2009.     

Efficient simulation of tissue-like P systems by transition cell-like P systems

In the framework of P systems, it is known that the construction of exponential number of objects in polynomial time is not enough to efficiently solve NP-complete problems. Nonetheless, it could be sufficient to create an exponential number of membranes in polynomial time. Working with P systems whose membrane structure does not increase in size, it is known that it is not possible to solve computationally hard problems (unless P = NP), basically due to the impossibility of constructing exponential number of membranes, in polynomial time, using only evolution, communication and dissolution rules. In this paper we show how a family of recognizer tissue P systems with symport/antiport rules which solves a decision problem can be efficiently simulated by a family of basic recognizer P systems solving the same problem. This simulation allows us to transfer the result about the limitations in computational power, from the model of basic cell-like P systems to this kind of tissue-like P systems.     

Effect of treatment with 13-cis-retinoic acid and ara-C on the hematopoietic stem cells of patients with myelodysplastic syndromes

PURPOSE: To assess the "in vivo" effect of 13-cis-retinoic acid and low dose Ara-C in MDS as well as to establish "in vitro" advantage of retinoid dose-related growth pattern on bone marrow cultures as defined by culture timing and CFU-GM proliferative response. PATIENTS AND METHODS: We evaluated 28 patients diagnosed of MDS according to FAB classification, of whom 4 cases had RA, 8 cases SRA, 14 cases RAEB and 2 cases RAEB-T. Patients who had RA and SRA were treated with oral 13-cis-retinoic acid at doses of 20-40 mg daily for 4 months and those cases with RAEB and RAEB-T had subcutaneous Ara-C at doses of 3 mg/m2 twice a day for 21 days. The "in vivo" and "in vitro" effect of retinoic acid on the haemopoietic differentiation was evaluated by the growth CFU-GM in semisolid cell culture methods. RESULTS: Increasing in vitro concentrations of 13-cis retinoic acid did not enhance the growth of myelodysplastic progenitors. Nevertheless, our study did not find any beneficial therapeutic effect of retinoic compounds in MDS patients. In this study, low-dose Ara-C (3 mg/m2) showed similar effects when compared with higher doses reported by others. Furthermore, in terms of CFU-GM proliferation the concentration of colonies before and after treatment were fairly similar in all but two patients. CONCLUSIONS: The results drawn from our study demonstrated that there is no beneficial advantage of 13-cis-retinoic acid as a differentiation inducing agent on myelodysplastic patients. In contrast, lower doses of Ara-C showed similar effects on haemopoiesis of MDS patients than standard doses of 10-20 mg/m2 but with less side effects.     

Empirical Comparisons of X‐bar Charts when Control Limits are Estimated

A control chart is a very common tool used to monitor the quality of business processes. An estimator of the process variability is generally considered to obtain the control limits of a chart when parameters of the process are unknown. Assuming Monte Carlo simulations, this paper first compares the efficiency of the various estimators of the process variability. Two empirical measures used to analyze the performance of control charts are defined. Results derived from various empirical studies reveal the existence of a linear relationship between the performance of the various estimators of the process variability and the performance of charts. The various Monte Carlo simulations are conducted under the assumption that the process is in both situations of in‐control and out‐of‐control. Copyright © 2015 John Wiley & Sons, Ltd.