TOF-SIMS imaging of chlorhexidine-digluconate transport in frozen hydrated biofilms of the fungus Candida albicans

The diffusion of the anti-microbial chlorhexidine digluconate (CHG) has been studied in C. albicans biofilms by time-of-flight secondary-ion mass spectrometry (TOF-SIMS). C. albicans has been shown to become resistant to common anti-microbial agents, including CHG, when growing as a biofilm. Mass transport resistance within biofilms has commonly been suggested as a resistance mechanism, but measurement of transport for most anti-microbial agents in biofilms has proven extremely difficult because of the heterogeneity of the biofilms and the difficulty in detecting these agents within an intact biofilm. In this study, TOF-SIMS has been used to study the transport of CHG and glucose in a frozen hydrated biofilm. The TOF-SIMS images reveal a progression of CHG from the top of the biofilm to its base with time. Images suggest that there are channels within the biofilm and show preferential binding of CHG to cellular components of the biofilm. Additionally, both living and dead cells can be identified in the TOF-SIMS images by the sequestration of K⁺ and the presence of cell markers. This study demonstrates that TOF-SIMS has the unique potential to simultaneously observe the presence of an antimicrobial agent, concentration of nutrients, and the viability of the cell population.     

Dynamic surface tension measurements of surfactant solutions using the maximum bubble pressure method – limits of applicability

One of the essential differences in the design of bubble pressure tensiometers consists in the geometry of the measuring capillaries. To reach extremely short adsorption times of milliseconds and below, the so-called deadtime of the capillaries must be of the order of some 10 ms. In particular, for concentrated surfactant solutions, such as micellar solutions, short deadtimes are needed to minimize the initial surfactant load of the generated bubbles. A theoretical model is derived and confirmed by experiments performed for a wide range of experimental conditions, mainly in respect to variations in deadtime and bubble volume.     

Local approximations for maximum partial subgraph problem

We deal with MAXH₀-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ₀+1)/(B+2+ν₀), where B=max_v∈Vd_G(v), δ₀=min_v∈V(H0)d_H0(v) and ν₀=(|V(H₀)|+1)/δ₀. Next, we show that this ratio rises up to 3/(B+1) when H₀=K₃. Finally, we provide hardness results for MAXK₃-FREE PARTIAL SUBGRAPH.     

A greedy algorithm for multicut and integral multiflow in rooted trees

We present an O(min(Kn,n²)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality.     

Necessary conditions and non-existence results for autonomous nonconvex variational problems

Classical one-dimensional, autonomous Lagrange problems are considered. In absence of any smoothness, convexity or coercivity condition on the energy density, we prove a DuBois-Reymond type necessary condition, expressed as a differential inclusion involving the subdifferential of convex analysis. As a consequence, a non-existence result is obtained.     

Parametric and Non Homogeneous Semi-Markov Process for HIV Control

In AIDS control, physicians have a growing need to use pragmatically useful and interpretable tools in their daily medical taking care of patients. Semi-Markov process seems to be well adapted to model the evolution of HIV-1 infected patients. In this study, we introduce and define a non homogeneous semi-Markov (NHSM) model in continuous time. Then the problem of finding the equations that describe the biological evolution of patient is studied and the interval transition probabilities are computed. A parametric approach is used and the maximum likelihood estimators of the process are given. A Monte Carlo algorithm is presented for realizing non homogeneous semi-Markov trajectories. As results, interval transition probabilities are computed for distinct times and follow-up has an impact on the evolution of patients.      

An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|r_j|L_max which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity.