Multi-agent system for distributed manufacturing scheduling with genetic algorithms and tabu search

Computerized scheduling methods and computerized scheduling systems according to exemplary embodiments. A computerized scheduling method may be stored in a memory and executed on one or more processors. The method may include defining a main multi-machine scheduling problem as a plurality of single machine scheduling problems; independently solving the plurality of single machine scheduling problems thereby calculating a plurality of near optimal single machine scheduling problem solutions; integrating the plurality of near optimal single machine scheduling problem solutions into a main multi-machine scheduling problem solution; and outputting the main multi-machine scheduling problem solution.

Simple laccase-based biosensor for formetanate hydrochloride quantification in fruits

This work describes the development of an electrochemical enzymatic biosensor for quantification of the pesticide formetanate hydrochloride (FMT). It is based on a gold electrode modified with electrodeposited gold nanoparticles and laccase. The principle behind its development relies on FMT's capacity to inhibit the laccase catalytic reaction that occurs in the presence of phenolic substrates. The optimum values for the relevant experimental variables such as gold nanoparticles electrochemical deposition (at − 0.2 V for 100 s), laccase immobilization (via glutaraldehyde cross-linking), laccase concentration (12.4 mg/mL), substrate selection and concentration (5.83×10−5 M of aminophenol), pH (5.0), buffer (Britton–Robinson), and square-wave voltammetric parameters were determined. The developed biosensor was successfully applied to FMT determination in mango and grapes. The attained limit of detection was 9.5×10−8 ± 9.5×10−10 M (0.02 ± 2.6×10−4 mg/kg on a fresh fruit weight basis). Recoveries for the five tested spiking levels ranged from 95.5 ± 2.9 (grapes) to 108.6 ± 2.5% (mango). The results indicated that the proposed device presents suitable characteristics in terms of sensitivity (20.58 ± 0.49 A/μM), linearity (9.43×10−7 to 1.13×10−5 M), accuracy, repeatability (RSD of 1.4%), reproducibility (RSD of 1.8%) and stability (19 days) for testing of compliance with established maximum residue limits of FMT in fruits and vegetables.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.

Task Assignment Algorithms for Heterogeneous Multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising a constant number (denoted by t) of distinct types of processors—such a platform is referred to as a t-type platform. We present two algorithms, LPGIM and LPGNM, each providing the following guarantee. For a given t-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet their deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then: (i) LPGIM succeeds in finding such an assignment where the same restriction on task migration applies (intra-migrative) but given a platform in which only one processor of each type is 1 + α × t-1/t times faster and (ii) LPGNM succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which every processor is 1 + α times faster. The parameter α is a property of the task set; it is the maximum of all the task utilizations that are no greater than one. To the best of our knowledge, for t-type heterogeneous multiprocessors: (i) for the problem of intra-migrative task assignment, no previous algorithm exists with a proven bound and hence our algorithm, LPGIM, is the first of its kind and (ii) for the problem of non-migrative task assignment, our algorithm, LPGNM, has superior performance compared to state-of-the-art.

Une langue étragère, un ordinateur, une image: c'est simple comme bonjour!

Este artigo surgiu na sequência de um atelier “Une langue étrangère, un ordinateur, une image: c’est simple comme bonjour!”, desenvolvido no âmbito do XXI Congresso da Associação Portuguesa dos Professores de Francês, Images et imaginaires pour agir. Teve como propósito divulgar, experimentar e refletir sobre recursos digitais que podem dar um bom contributo ao processo de ensino e aprendizagem do Francês Língua Estrangeira (FLE). Evidencia-se o poder da imagem na construção do conhecimento, desafiando a criatividade e novos modos de ensinar a aprender. Verificou-se que os professores se interessaram pelas ferramentas digitais e evidenciaram a sua importância e a sua aplicabilidade nos contextos educativos. Neste sentido, o artigo divulga ferramentas informáticas focadas no desenvolvimento da oralidade/leitura/escrita do francês língua estrangeira, refere boas práticas de utilização em contexto de sala de aula, constituindo uma contribuição para a renovação da escola.

Disposable immunosensor using a simple method for oriented antibody immobilization for label-free real-time detection of an oxidative stress biomarker implicated in cancer diseases

This work proposes a novel approach for a suitable orientation of antibodies (Ab) on an immunosensing platform, applied here to the determination of 8-hydroxy-2′-deoxyguanosine (8OHdG), a biomarker of oxidative stress that has been associated to chronic diseases, such as cancer. The anti-8OHdG was bound to an amine modified gold support through its Fc region after activation of its carboxylic functions. Non-oriented approaches of Ab binding to the platform were tested in parallel, in order to show that the presented methodology favored Ab/Ag affinity and immunodetection of the antigen. The immunosensor design was evaluated by quartz-crystal microbalance with dissipation, atomic force microscopy, electrochemical impedance spectroscopy (EIS) and square-wave voltammetry. EIS was also a suitable technique to follow the analytical behavior of the device against 8OHdG. The affinity binding between 8OHdG and the antibody immobilized in the gold modified platform increased the charge transfer resistance across the electrochemical set-up. The observed behavior was linear from 0.02 to 7.0 ng/mL of 8OHdG concentrations. The interference from glucose, urea and creatinine was found negligible. An attempt of application to synthetic samples was also successfully conducted. Overall, the presented approach enabled the production of suitably oriented Abs over a gold platform by means of a much simpler process than other oriented-Ab binding approaches described in the literature, as far as we know, and was successful in terms of analytical features and sample application.

Disposable immunosensor with simple antibody orientation for label-free real-time detection of a cancer biomarker

This work proposes a novel approach for a suitable orientation of antibodies (Ab) on an immunosensing platform, applied here to the determination of 8-hydroxy-2’-deoxyguanosine (8OHdG), a biomarker of oxidative stress that has been associated to chronic diseases, such as cancer. The Anti-8OHdG was bound to an amine modified gold support through its Fc region after activation of its carboxylic functions. Non-oriented approaches of Ab binding to the platform were tested in parallel, in order to show that the presented proposal favored Ab/Ag affinity. The immunosensor design was evaluated by Quartz-Crystal microbalance with Dissipation, Atomic Force Microscopy, Electrochemical Impedance Spectroscopy (EIS) and Square-Wave Voltammetry. EIS was also a suitable technique to follow the analytical behavior of the device against 8OHdG. The affinity binding between 8OHdG and the antibody immobilized in the gold modified platform increased the charged transfer resistance across the electrochemical sep-up. The observed behavior was linear from 0.02 to 7.0 ng/mL of 8OHdG concentrations. The interference from Glucose, Urea and Creatinine was found negligible. An attempt of application to synthetic samples was also successfully conducted. Overall, the presented approach enabled the production of suitably oriented Abs over a gold platform by means of a much simpler process than other oriented-Ab binding approaches described in the literature, as far as we know, and was successful in terms of analytical features and sample application.

New Concepts Towards the Synthesis of Digital Circuits Through Genetic Algorithms

This paper analyses the performance of a Genetic Algorithm using two new concepts, namely a static fitness function including a discontinuity measure and a fractional-order dynamic fitness function, for the synthesis of combinational logic circuits. In both cases, experiments reveal superior results in terms of speed and convergence to achieve a solution.

Simple Kinematic Design for Evading the Forced Oscillation of a Car-Wheel Suspension System

An adaptive control damping the forced vibration of a car while passing along a bumpy road is investigated. It is based on a simple kinematic description of the desired behavior of the damped system. A modified PID controller containing an approximation of Caputo’s fractional derivative suppresses the high-frequency components related to the bumps and dips, while the low frequency part of passing hills/valleys are strictly traced. Neither a complete dynamic model of the car nor ’a priori’ information on the surface of the road is needed. The adaptive control realizes this kinematic design in spite of the existence of dynamically coupled, excitable internal degrees of freedom. The method is investigated via Scicos-based simulation in the case of a paradigm. It was found that both adaptivity and fractional order derivatives are essential parts of the control that can keep the vibration of the load at bay without directly controlling its motion.

System Modeling and Control Through Fractional-Order Algorithms

The theory of fractional calculus goes back to the beginning of thr throry of differential calculus but its inherent complexity postponed the applications of the associated concepts. In the last decade the progress in the areas of chaos and fractals revealed subtle relationships with the fractional calculus leading to an increasing interest in the development of the new paradigm. In the area of automaticcontrol preliminary work has already been carried out but the proposed algorithms are restricted to the frequency domain. The paper discusses the design of fractional-order discrete-time controllers. The algorithms studied adopt the time domein, which makes them suited for z-transform analusis and discrete-time implementation. The performance of discrete-time fractional-order controllers with linear and non-linear systems is also investigated.

mRPL: Boosting mobility in the Internet of Things

The 6loWPAN (the light version of IPv6) and RPL (routing protocol for low-power and lossy links) protocols have become de facto standards for the Internet of Things (IoT). In this paper, we show that the two native algorithms that handle changes in network topology – the Trickle and Neighbor Discovery algorithms – behave in a reactive fashion and thus are not prepared for the dynamics inherent to nodes mobility. Many emerging and upcoming IoT application scenarios are expected to impose real-time and reliable mobile data collection, which are not compatible with the long message latency, high packet loss and high overhead exhibited by the native RPL/6loWPAN protocols. To solve this problem, we integrate a proactive hand-off mechanism (dubbed smart-HOP) within RPL, which is very simple, effective and backward compatible with the standard protocol. We show that this add-on halves the packet loss and reduces the hand-off delay dramatically to one tenth of a second, upon nodes’ mobility, with a sub-percent overhead. The smart-HOP algorithm has been implemented and integrated in the Contiki 6LoWPAN/RPL stack (source-code available on-line mrpl: smart-hop within rpl, 2014) and validated through extensive simulation and experimentation.

Feature Extraction in Densely Sensed Environments: Extensions to Multiple Broadcast Domains

The vision of the Internet of Things (IoT) includes large and dense deployment of interconnected smart sensing and monitoring devices. This vast deployment necessitates collection and processing of large volume of measurement data. However, collecting all the measured data from individual devices on such a scale may be impractical and time consuming. Moreover, processing these measurements requires complex algorithms to extract useful information. Thus, it becomes imperative to devise distributed information processing mechanisms that identify application-specific features in a timely manner and with a low overhead. In this article, we present a feature extraction mechanism for dense networks that takes advantage of dominance-based medium access control (MAC) protocols to (i) efficiently obtain global extrema of the sensed quantities, (ii) extract local extrema, and (iii) detect the boundaries of events, by using simple transforms that nodes employ on their local data. We extend our results for a large dense network with multiple broadcast domains (MBD). We discuss and compare two approaches for addressing the challenges with MBD and we show through extensive evaluations that our proposed distributed MBD approach is fast and efficient at retrieving the most valuable measurements, independent of the number sensor nodes in the network.

Rat muscle opacity decrease due to the osmosis of a simple mixture

It is known that the fibrous structure of muscle causes light scattering. This phenomenon occurs due to the refractive index discontinuities located between muscle fibers and interstitial fluid. To study the possibility of reducing light scattering inside muscle, we consider its spectral transmittance evolution during an immersion treatment with an optical clearing solution containing ethanol, glycerol, and distilled water. Our methodology consists of registering spectral transmittance of muscle samples while immersed in that solution. With the spectral data collected, we represent the transmittance evolution for some wavelengths during the treatment applied. Additionally, we study the variations that the treatment has caused on the samples regarding tissue refractive index and mass. By analyzing microscopic photographs of tissue cross section, we can also verify changes in the internal arrangement of muscle fibers caused by the immersion treatment. Due to a mathematical model that we develop, we can explain the variations observed in the studied parameters and estimate the amount of optical clearing agent that has diffused into the tissue samples during the immersion treatment. At the end of the study, we observe and explain the improvement in tissue spectral transmittance, which is approximately 65% after 20 min.

Testing Nelder-Mead Based Repulsion Algorithms for Multiple Roots of Nonlinear Systems via a Two-Level Factorial Design of Experiments

This paper addresses the challenging task of computing multiple roots of a system of nonlinear equations. A repulsion algorithm that invokes the Nelder-Mead (N-M) local search method and uses a penalty-type merit function based on the error function, known as 'erf', is presented. In the N-M algorithm context, different strategies are proposed to enhance the quality of the solutions and improve the overall efficiency. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm.