Polite Combination of Algebraic Datatypes

Journal of Automated Reasoning - Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its...     

Mild Binding of Protein to C2N Monolayer Reveals Its Suitable Biocompatibility

The development of biocompatible nanomaterials for smart drug delivery and bioimaging has attracted great interest in recent years in biomedical fields. Here, the interaction between the recently reported nitrogenated graphene (C₂N) and a prototypical protein (villin headpiece HP35) utilizing atomistic molecular dynamics simulations is studied. The simulations reveal that HP35 can form a stable binding with the C₂N monolayer. Although the C₂N–HP35 attractive interactions are constantly preserved, the binding strength between C₂N and the protein is mild and does not cause significant distortion in the protein's structural integrity. This intrinsic biofriendly property of native C₂N is distinct from several widely studied nanomaterials, such as graphene, carbon nanotubes, and MoS₂, which can induce severe protein denaturation. Interestingly, once the protein is adsorbed onto C₂N surface, its transverse migration is highly restricted at the binding sites. This restriction is orchestrated by C₂N's periodic porous structure with negatively charged “holes,” where the basic residues—such as lysine—can form stable interactions, thus functioning as “anchor points” in confining the protein displacement. It is suggested that the mild, immobilized protein attraction and biofriendly aspects of C₂N would make it a prospective candidate in bio‐ and medical‐related applications.     

Ultra-dense planar metallic nanowire arrays with extremely large anisotropic optical and magnetic properties

A nanofabrication method for the production of ultra-dense planar metallic nanowire arrays scalable to wafer-size is presented. The method is based on an efficient template deposition process to grow diverse metallic nanowire arrays with extreme regularity in only two steps. First, III–V semiconductor substrates are irradiated by a low-energy ion beam at an elevated temperature, forming a highly ordered nanogroove pattern by a “reverse epitaxy” process due to self-assembly of surface vacancies. Second, diverse metallic nanowire arrays (Au, Fe, Ni, Co, FeAl alloy) are fabricated on these III–V templates by deposition at a glancing incidence angle. This method allows for the fabrication of metallic nanowire arrays with periodicities down to 45 nm scaled up to wafer-size fabrication. As typical noble and magnetic metals, the Au and Fe nanowire arrays produced here exhibited large anisotropic optical and magnetic properties, respectively. The excitation of localized surface plasmon resonances (LSPRs) of the Au nanowire arrays resulted in a high electric field enhancement, which was used to detect phthalocyanine (CoPc) in surface-enhanced Raman scattering (SERS). Furthermore, the Fe nanowire arrays showed a very high in-plane magnetic anisotropy of approximately 412 mT, which may be the largest in-plane magnetic anisotropy field yet reported that is solely induced via shape anisotropy within the plane of a thin film.

Open image in new window

     

Modelling co-operation in the design of knowledge production systems: The Made In'Coop method

This paper presents the latest developments of the MadeIn 'Coop method for modelling the human-machine and human-human co-operation process, and an application of this method for the design of a more co-operative version of the C³I System CHEOPS. We first consider that the design of software systems for organizations is tied more and more to the perspective of compound Knowledge Production Systems that link humans and machines engaged in a co-operative problem solving process. After exposing the four principles upon which MadeIn 'Coop rests for modelling co-operation, we present an artificial problem solving dialogue between CHEOPS and its users. Consistent with the Group Cognitive Processes Theory framework, we propose a dialogue analysis according to two complimentary points of view: the Collective Problem Solving model, and the Coordination model. This analysis should help system designers to identify new system functionalities to assist problem solving.(C³I) Command Control Communication Intelligence Systems     

Estimation of nonlinear systems via a Chebyshev approximation approach

This paper proposes to decompose the nonlinear dynamic of a chaotic system with Chebyshev polynomials to improve performances of its estimator. More widely than synchronization of chaotic systems, this algorithm is compared to other nonlinear stochastic estimator such as Extended Kalman Filter (EKF) and Unscented Kalman Filter (UKF). Chebyshev polynomials orthogonality properties is used to fit a polynomial to a nonlinear function. This polynomial is then used in an Exact Polynomial Kalman Filter (ExPKF) to run real time state estimation. The ExPKF offers mean square error optimality because it can estimate exact statistics of transformed variables through the polynomial function. Analytical expressions of those statistics are derived so as to lower ExPKF algorithm computation complexity and allow real time applications. Simulations under the Additive White Gaussian Noise (AWGN) hypothesis, show relevant performances of this algorithm compared to classical nonlinear estimators.     

Surrogate modeling approximation using a mixture of experts based on EM joint estimation

An automatic method to combine several local surrogate models is presented. This method is intended to build accurate and smooth approximation of discontinuous functions that are to be used in structural optimization problems. It strongly relies on the Expectation−Maximization (EM) algorithm for Gaussian mixture models (GMM). To the end of regression, the inputs are clustered together with their output values by means of parameter estimation of the joint distribution. A local expert is then built (linear, quadratic, artificial neural network, moving least squares) on each cluster. Lastly, the local experts are combined using the Gaussian mixture model parameters found by the EM algorithm to obtain a global model. This method is tested over both mathematical test cases and an engineering optimization problem from aeronautics and is found to improve the accuracy of the approximation.     

Efficient on-line signature recognition based on multi-section vector quantization

This paper proposes a multi-section vector quantization approach for on-line signature recognition. We have used a database of 330 users which includes 25 skilled forgeries performed by 5 different impostors. This database is larger than those typically used in the literature. Nevertheless, we also provide results from the SVC database. Our proposed system obtains similar results as the state-of-the-art online signature recognition algorithm, Dynamic Time Warping, with a reduced computational requirement, around 47 times lower. In addition, our system improves the database storage requirements due to vector compression, and is more privacy-friendly because it is not possible to recover the original signature using the codebooks. Experimental results reveal that our proposed multi-section vector quantization achieves a 98% identification rate, minimum Detection Cost Function value equal to 2.29% for random forgeries and 7.75% for skilled forgeries.