Force Curve Measurements with the AFM: Application to the In Situ Determination of Grafted Silicon-Wafer Surface Energies

The atomic force microscope (AFM) can be used to perform surface force measurements in the quasi-static mode (cantilever is not oscillating) to investigate nanoscale surface properties. Nevertheless, there is still a lack of literature proposing a complete systematic and rigorous experimental procedure that enables one to obtain reproducible and significant quantitative data. This article focuses on the fundamental experimental difficulties arising when making force curve measurements with the AFM in air. On the basis of this AFM calibration procedure, quantitative assessment values were used to determine, in situ, SAM (or Self Assembled Monolayer)-tip thermodynamic work of adhesion at a local scale, which have been found to be in good agreement with quoted values. Finally, determination of surface energies of functionalised silicon wafers (as received, CH₃, OH functionalised silicon wafers) with the AFM (at a local scale) is also proposed and compared with the values obtained by wettability (at a macroscopic scale). In particular, the effect of the capillary forces is discussed.     

Nomemclature of the proteins of cow's milk: fourth revision.

This report reviews the nomenclature of the milk proteins of cow's milk in light of more recent advances in our knowledge. With the establishment of the primary structures of a number of these proteins, we now have a definite identification of alphas1-, kappa-, beta-, and the gamma-caseins as well as beta-lactoglobulin and alpha-lactalbumin. On the basis of new information on their primary structures and relationship to beta-casein polymorphs, changes in nomenclature have been recommended for proteins of the gamma-casein fraction. Although the primary structure serves as the unambiguous definition of proteins for which it is known, a more practical identification is necessary. We recommend that their behavior in gel electrophoresis under suitable conditions be employed for this purpose for all of the "major" milk proteins of raw skim milk except the immunoglobulins where, because of their heterogeneity and molecular genetics, physical parameters are less useful and their identification must be based upon antigenic determinants and their homology with their human counterparts. More work is needed and, with the accumulation of more information, additional changes in nomenclature can be expected for such proteins as the minor components of alphas- and kappa-caseins, alpha-lactalbumin, and the proteose-peptone fraction as well as further confirmation of the presence of immunoglobulins IgE and additional IgG subclasses. Additional components and genetic variants also can be expected.     

Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections

The problem of reconstructing a pattern of an object from its approximate discrete orthogonal projections in a 2-dimensional grid, may have no solution because the inaccuracy in the measurements of the projections may generate an inconsistent problem. To attempt to overcome this difficulty, one seeks to reconstruct a pattern with projection values having possibly some bounded differences with the given projection values and minimizing the sum of the absolute differences.

This paper addresses the problem of reconstructing a pattern with a difference at most equal to +1 or −1 between each of its projection values and the corresponding given projection value. We deal with the case of patterns which have to be horizontally and vertically convex and the case of patterns which have to be moreover connected, the so-called convex polyominoes. We show that in both cases, the problem of reconstructing a pattern can be transformed into a Satisfiability (SAT) Problem. This is done in order to take advantage of the recent advances in the design of solvers for the SAT Problem. We show, experimentally, that by adding two important features to CSAT (an efficient SAT solver), optimal patterns can be found if there exist feasible ones. These two features are: first, a method that extracts in linear time an optimal pattern from a set of feasible patterns grouped in a generic pattern (obtaining a generic pattern may be exponential in the worst case) and second, a method that computes actively a lower bound of the sum of absolute differences that can be obtained from a partially defined pattern. This allows to prune the search tree if this lower bound exceeds the best sum of absolute differences found so far.     

A Cost-Optimal Pipeline Algorithm for Permutation Generation in Lexicographic Order

In this paper we solve the open problem of designing a cost-optimal parallel algorithm for generating permutations ofMelements out of the set {0, 1, …,N− 1}, in lexicographic order. Our algorithm runs on the simplest model of parallel computation, i.e., a linear array of sizeM, where each processor PE(i) needs only a constant number of words of length logN, and is responsible for producing with constant delay, theith components in the successive permutations. This algorithm runs in timeO(N!/(N−M)!) on an array of sizeMand is therefore cost-optimal when the time needed to output the permutations is taken into account. Moreover, by doubling the number of cells, it is possible to implement this algorithm on a unidirectional linear array.     

Toward green dialysis: Focus on water savings

Hemodialysis is one of the most water and energy‐hungry medical procedures, and thus represents a clear opportunity where improvements should be made concerning the consumption and wastage of water. Three levels were investigated on which there are potential savings: the precise adjustment of water production according to specific needs, the reuse of reverse osmosis rejected water, and finally the huge volumes of post‐patient dialysate effluent. The “AURAL” (Association pour l′Utilisation du Rein Artificiel à Lyon), main unit in Lyon, was the site of investigation for this study, which cares for 173 chronic hemodialysis patients. Evaluation of the 3 levels described earlier was undertaken on this particular building, and on the water treatment currently used. Volumes of produced water can be improved by different hydraulic systems or by adjusting the pure water conductivity used for dialysis. Concerning the reject water, reuse for building sanitation became the focus of further attention. The technical feasibility, volume of saved water, and applicable work costs were considered. The results suggest that out of a possible 2834 m³/year of reject water, 1200 m³/year may be reused and return on investment recovered within 5.8 years. Finally, the reprocessing and feasibility of reuse of dialysate effluent were investigated. Initial calculations show that although technical solutions are available, such processing of the wastewater production is not profitable in the short term. Regarding the significant prior authorization and risk management analysis necessary for such a project, this avenue was pursued no further. From the perspective of a “green dialysis,” the reuse of reject water into sanitation is both viable and profitable in our unit, and must be the next step of our project. More widely, improvements can be made by defining a more precise range of pure water conductivity for dialysis and by applying reuse water project to new or to be renovated units.     

On the improvement of network resource utilization efficiency for the establishment of static dependable connections in SRLG-constrained WDM translucent networks

In this paper, we investigate the problem of establishing static connections with fault-tolerant requirements, also known as dependable connections, taking into account quality of transmission constraints. To the best of our knowledge, this is the first study that tackles the aforementioned problem under shared risk link group (SRLG) constraints in translucent WDM optical mesh networks where typically a set of strategically localized network nodes are equipped with regeneration capability to overcome physical-layer impairment effects. A novel cross-layer heuristic approach is introduced to solve the problem for an heterogeneous networked scenario relying on a cost-effective two-stage protection procedure which combines the well-known path protection and partial path protection schemes in order to ensure instantaneous recovery from any SRLG-failure event. The proposed heuristic integrates a generic auxiliary graph model that incorporates various network heterogeneity factors such as the number of transceivers at each network node, the number of wavelengths on each fiber link, and the regeneration capability of each node, represented by different edges in the constructed graph. Moreover, the integrated auxiliary graph can be applied efficiently to model either single- or mixed-line-rate translucent WDM optical networks wherein different modulation formats are employed in order to support the transmission at different line rates. Our solution approach aims at maximizing the total number of accommodated requests by reducing network resource consumption through the simultaneous use of the backup–backup and primary–backup multiplexing techniques. We, here, present extended versions of these two techniques that generalize the sharing concept to some other important node resources—specifically, regeneration equipments which constitute the major cost factor in optical transport networks—in addition to link resources (i.e., wavelength channels). As far as we know, this is the first attempt to deploy simultaneously generalized versions of the backup–backup and primary–backup multiplexing techniques when considering static traffic patterns without compromising the 100 % fault-recoverability guarantee. The performances of the proposed heuristic are evaluated and discussed through extensive numerical experiments carried out on different network topologies. Significant improvements are demonstrated, either in terms of network blocking performance or in terms of resource utilization efficiency, in comparison with previously proposed approaches.     

Statistical tolerance analysis of a hyperstatic mechanism,using system reliability methods

The quality level of a mechanism can be evaluated a posteriori after several months by following the number of warranty returns. However, it is more interesting to evaluate a predicted quality level in the design stage: this is one of the aims of statistical tolerance analysis. A possible method consists of computing the defect probability (P_D) expressed in ppm. It represents the probability that a functional requirement will not be satisfied in mass production. For assembly reasons, many hyperstatic mechanisms require gaps, which their functional requirements depend on. The defect probability assessment of such mechanisms is not straightforward, and requires advanced numerical methods. This problem particularly interests the VALEO W.S. company, which experiences problems with an assembly containing gaps. This paper proposes an innovative methodology to formulate and compute the defect probability of hyperstatic mechanisms with gaps in two steps. First, a complex feasibility problem is converted into a simpler problem. Then the defect probability is efficiently computed thanks to system reliability methods and the m-dimensional multivariate normal distribution Φ_m. Finally, a sensitivity analysis is provided to improve the original design. The whole approach is illustrated with an industrial case study, but can be adapted to other similar problems.