Mathematical Modelling of Glyphosate Molecularly Imprinted Polymer-Based Microsensor with Multiple Phenomena

The massive and careless use of glyphosate (GLY) in agricultural production raises many questions regarding environmental pollution and health risks, it is then important to develop simple methods to detect it. Electrochemical impedance spectroscopy (EIS) is an effective analytical tool for characterizing properties at the electrode/electrolyte interface. It is useful as an analytical procedure, but it can also help in the interpretation of the involved fundamental electrochemical and electronic processes. In this study, the impedance data obtained experimentally for a microsensor based on molecularly imprinted chitosan graft on 4-aminophenylacetic acid for the detection of glyphosate was analyzed using an exact mathematical model based on physical theories. The procedure for modeling experimental responses is well explained. The analysis of the observed impedance response leads to estimations of the microscopic parameters linked to the faradic and capacitive current. The interaction of glyphosate molecules with the imprinted sites of the CS-MIPs film is observed in the high frequency range. The relative variation of the charge transfer resistance is proportional to the log of the concentration of glyphosate. The capacitance decreases as the concentration of glyphosate increases, which is explained by the discharging of the charged imprinted sites when the glyphosate molecule interacts with the imprinted sites through electrostatic interactions. The phenomenon of adsorption of the ions in the CMA film is observed in the low frequency range, this phenomenon being balanced by the electrostatic interaction of glyphosate with the imprinted sites in the CS-MIPs film.     

Evaluation of the Long‐term Cumulative UVA Facial Exposure of Queensland School Teachers derived for an Extended Period from the OMI Satellite Irradiance

This research presents a novel methodology for deriving the total daily broadband solar UVA (320–400 nm) received by school teachers during their working day from Ozone Monitoring Instrument (OMI) satellite solar noon UVA irradiance measurements for a Queensland subtropical site (27.5°S, 152°E). Daily UVA exposures are weighted to the anatomical human cheek (anterior infra‐orbital region) for teachers wearing and not wearing broad‐brimmed hats. The method utilizes the OMI UVA irradiance data collected daily at high temporal resolution over 2005 to 2016 to derive the total daily UVA exposure to a horizontal plane. These horizontal plane exposures are scaled by factors to take into account the timing of outdoor activity. The relationship between exposures to a horizontal plane and those to a vertical plane and the protection provided by a broad‐brimmed hat was assessed to evaluate the total daily UVA exposures to the cheek for classroom and physical education teaching staff expected to be outside at different periods of the day. The developed method enables the total daily UVA exposure to specific anatomical sites to be evaluated from the satellite solar noon irradiance at locations that do not have access to surface‐based instrumentation capable of recording in the solar UVA waveband.     

On Some Measure Convolution Operators in Neutron Transport Theory

We show how some fundamental spectral properties of neutron transport semigroups in L ^p spaces (1<p<+∞), such as stability of essential spectra or critical spectra and related results, can be inferred from the study of two measure convolution operators on  \(\mathbb{R}^{n}\) .     

Asymptotic analysis of contact problems between an elastic material and thin-rigid plates

We consider an elastic material in contact with a three-dimensional rigid plate of varying thickness. We suppose that a perfect adhesion occurs along thin zones disposed in a self-similar way on the interface between the two materials. We suppose that the elasticity coefficients in the plate depend on its thickness and tend to infinity as this thickness tends to zero. We derive the effective material properties using Γ-convergence methods.     

Sous ellipticite dans le cadre du calcul S(m,g)

Abstract

We study the regularity of the free boundary in the two membranes problem. We prove that around any point the free boundary is either a C ^{1, α} surface or a cusp, as in the obstacle problem. We also prove C ^{1, 1} regularity for the pair of functions solving the problem.     

A novel fuzzy C-means algorithm to generate diverse and desirable cluster solutions used by genetic-based clustering ensemble algorithms

One of the most significant discussions in the field of machine learning today is on the clustering ensemble. The clustering ensemble combines multiple partitions generated by different clustering algorithms into a single clustering solution. Genetic algorithms are known for their high ability to solve optimization problems, especially the problem of the clustering ensemble. To date, despite the major contributions to find consensus cluster partitions with application of genetic algorithms, there has been little discussion on population initialization through generative mechanisms in genetic-based clustering ensemble algorithms as well as the production of cluster partitions with favorable fitness values in first phase clustering ensembles. In this paper, a threshold fuzzy C-means algorithm, named TFCM, is proposed to solve the problem of diversity of clustering, one of the most common problems in clustering ensembles. Moreover, TFCM is able to increase the fitness of cluster partitions, such that it improves performance of genetic-based clustering ensemble algorithms. The fitness average of cluster partitions generated by TFCM are evaluated by three different objective functions and compared against other clustering algorithms. In this paper, a simple genetic-based clustering ensemble algorithm, named SGCE, is proposed, in which cluster partitions generated by the TFCM and other clustering algorithms are used as the initial population used by the SGCE. The performance of the SGCE is evaluated and compared based on the different initial populations used. The experimental results based on eleven real world datasets demonstrate that TFCM improves the fitness of cluster partitions and that the performance of the SGCE is enhanced using initial populations generated by the TFCM.     

Numerical solution for a sub-diffusion equation with a smooth kernel

In this paper we study the numerical solution of an initial value problem of a sub-diffusion type. For the time discretization we apply the discontinuous Galerkin method and we use continuous piecewise finite elements for the space discretization. Optimal order convergence rates of our numerical solution have been shown. We compare our theoretical error bounds with the results of numerical computations. We also present some numerical results showing the super-convergence rates of the proposed method.     

Vertex-edge domination in graphs

In this paper we study graph parameters related to vertex-edge domination, where a vertex dominates the edges incident to it as well as the edges adjacent to these incident edges. First, we present new relationships relating the ve-domination to some other domination parameters, answering in the affirmative four open questions posed in the 2007 PhD thesis by Lewis. Then we provide an upper bound for the independent ve-domination number in terms of the ve-domination number for every nontrivial connected K_1,k-free graph, with k ≥ 3, and we show that the independent ve-domination number is bounded above by the domination number for every nontrivial tree. Finally, we establish an upper bound on the ve-domination number for connected C₅-free graphs, improving a recent bound given for trees.     

A discontinuous Galerkin method for time fractional diffusion equations with variable coefficients

We propose a piecewise-linear, time-stepping discontinuous Galerkin method to solve numerically a time fractional diffusion equation involving Caputo derivative of order μ ∈ (0, 1) with variable coefficients. For the spatial discretization, we apply the standard continuous Galerkin method of total degree ≤ 1 on each spatial mesh elements. Well-posedness of the fully discrete scheme and error analysis will be shown. For a time interval (0, T) and a spatial domain Ω, our analysis suggest that the error in \(L^{2}\left ((0,T),L^{2}({\Omega })\right )\)-norm is \(O(k^{2-\frac {\mu }{2}}+h^{2})\) (that is, short by order \(\frac {\mu }{2}\) from being optimal in time) where k denotes the maximum time step, and h is the maximum diameter of the elements of the (quasi-uniform) spatial mesh. However, our numerical experiments indicate optimal O(k² + h²) error bound in the stronger \(L^{\infty }\left ((0,T),L^{2}({\Omega })\right )\)-norm. Variable time steps are used to compensate the singularity of the continuous solution near t = 0.